dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Masahiro Kumabe Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe, H. Reiju Mihara: Computability of simple games: A complete investigation of the sixty-four possibilities CoRR abs/1102.4037: (2011)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe, H. Reiju Mihara: Preference aggregation theory without acyclicity: The core without majority dissatisfaction CoRR abs/1107.0431: (2011)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe, H. Reiju Mihara: The Nakamura numbers for computable simple games CoRR abs/1107.0439: (2011)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe, H. Reiju Mihara: Preference aggregation theory without acyclicity: The core without majority dissatisfaction. Games and Economic Behavior 72(1): 187-201 (2011)
2008
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe, Toshio Suzuki, Takeshi Yamazaki: Does truth-table of linear norm reduce the one-query tautologies to a random oracle? Arch. Math. Log. 47(2): 159-180 (2008)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe, H. Reiju Mihara: The Nakamura numbers for computable simple games. Social Choice and Welfare 31(4): 621-640 (2008)
2007
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe, H. Reiju Mihara: Computability of simple games: A characterization and application to the core CoRR abs/0705.3227: (2007)
2000
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe: A 1-Generic Degree with A Strong Minimal Cover. J. Symb. Log. 65(3): 1395-1442 (2000)
1996
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe: Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees. J. Symb. Log. 61(4): 1158-1192 (1996)
1994
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe: Minimal Upper Bounds for Arithmetical Degrees. J. Symb. Log. 59(2): 516-528 (1994)
1993
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe: Generic Degrees are Complemented. Ann. Pure Appl. Logic 59(3): 257-272 (1993)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe: Every n-Generic Degree Is a Minimal Cover of an n-Generic Degree. J. Symb. Log. 58(1): 219-231 (1993)
1991
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe: Relative Recursive Enumerability of Generic Degrees. J. Symb. Log. 56(3): 1075-1084 (1991)
1990
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahiro Kumabe: A 1-Generic Degree which Bounds a Minimal Degree. J. Symb. Log. 55(2): 733-743 (1990)

Coauthor Index

1H. Reiju Mihara [8] [9] [11] [12] [13] [14]
2Toshio Suzuki [10]
3Takeshi Yamazaki [10]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page