A 1-Generic Degree which Bounds a Minimal Degree. - Masahiro Kumabe (J. Symb. Log., 1990)

Relative Recursive Enumerability of Generic Degrees. - Masahiro Kumabe (J. Symb. Log., 1991)

Generic Degrees are Complemented. - Masahiro Kumabe (Ann. Pure Appl. Log., 1993)

Every n-Generic Degree Is a Minimal Cover of an n-Generic Degree. - Masahiro Kumabe (J. Symb. Log., 1993)

Minimal Upper Bounds for Arithmetical Degrees. - Masahiro Kumabe (J. Symb. Log., 1994)

Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees. - Masahiro Kumabe (J. Symb. Log., 1996)

A 1-Generic Degree with A Strong Minimal Cover. - Masahiro Kumabe (J. Symb. Log., 2000)

Computability of simple games: A characterization and application to the core - Masahiro Kumabe; H. Reiju Mihara (CoRR, 2007)

Does truth-table of linear norm reduce the one-query tautologies to a random oracle? - Masahiro Kumabe; Toshio Suzuki; Takeshi Yamazaki (Arch. Math. Log., 2008)

The Nakamura numbers for computable simple games. - Masahiro Kumabe; H. Reiju Mihara (Soc. Choice Welf., 2008)

Computability of simple games: A complete investigation of the sixty-four possibilities - Masahiro Kumabe; H. Reiju Mihara (CoRR, 2011)

Preference aggregation theory without acyclicity: The core without majority dissatisfaction. - Masahiro Kumabe; H. Reiju Mihara (Games Econ. Behav., 2011)

Resource-bounded martingales and computable Dowd-type generic sets. - Masahiro Kumabe; Toshio Suzuki (Inf. Comput., 2015)

Solovay reducibility and continuity. - Masahiro Kumabe; Kenshi Miyabe; Yuki Mizusawa; Toshio Suzuki (J. Log. Anal., 2020)