Masahiro Kumabe

Publication Activity (10 Years)

Years Active: 1990-2020
Publications (10 Years): 1

Top Topics

Information Gathering

Top Venues

Publications

Masahiro Kumabe, Kenshi Miyabe, Yuki Mizusawa, Toshio Suzuki
Solovay reducibility and continuity. J. Log. Anal. 12 (2020)
Masahiro Kumabe, Toshio Suzuki
Resource-bounded martingales and computable Dowd-type generic sets. Inf. Comput. 242 (2015)
Masahiro Kumabe, H. Reiju Mihara
The Nakamura numbers for computable simple games CoRR (2011)
Masahiro Kumabe, H. Reiju Mihara
Preference aggregation theory without acyclicity: The core without majority dissatisfaction. Games Econ. Behav. 72 (1) (2011)
Masahiro Kumabe, H. Reiju Mihara
Preference aggregation theory without acyclicity: The core without majority dissatisfaction CoRR (2011)
Masahiro Kumabe, H. Reiju Mihara
Computability of simple games: A complete investigation of the sixty-four possibilities CoRR (2011)
Masahiro 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) (2008)
Masahiro Kumabe, H. Reiju Mihara
The Nakamura numbers for computable simple games. Soc. Choice Welf. 31 (4) (2008)
Masahiro Kumabe, H. Reiju Mihara
Computability of simple games: A characterization and application to the core CoRR (2007)
Masahiro Kumabe
A 1-Generic Degree with A Strong Minimal Cover. J. Symb. Log. 65 (3) (2000)
Masahiro Kumabe
Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees. J. Symb. Log. 61 (4) (1996)
Masahiro Kumabe
Minimal Upper Bounds for Arithmetical Degrees. J. Symb. Log. 59 (2) (1994)
Masahiro Kumabe
Every n-Generic Degree Is a Minimal Cover of an n-Generic Degree. J. Symb. Log. 58 (1) (1993)
Masahiro Kumabe
Generic Degrees are Complemented. Ann. Pure Appl. Log. 59 (3) (1993)
Masahiro Kumabe
Relative Recursive Enumerability of Generic Degrees. J. Symb. Log. 56 (3) (1991)
Masahiro Kumabe
A 1-Generic Degree which Bounds a Minimal Degree. J. Symb. Log. 55 (2) (1990)