| 2008 |
|---|
| 9 | EE | 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): 159-180 (2008) |
| 2007 |
|---|
| 8 | EE | Masahiro Kumabe,
H. Reiju Mihara:
Computability of simple games: A characterization and application to the core
CoRR abs/0705.3227: (2007) |
| 2000 |
|---|
| 7 | | Masahiro Kumabe:
A 1-Generic Degree with A Strong Minimal Cover.
J. Symb. Log. 65(3): 1395-1442 (2000) |
| 1996 |
|---|
| 6 | | Masahiro Kumabe:
Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees.
J. Symb. Log. 61(4): 1158-1192 (1996) |
| 1994 |
|---|
| 5 | | Masahiro Kumabe:
Minimal Upper Bounds for Arithmetical Degrees.
J. Symb. Log. 59(2): 516-528 (1994) |
| 1993 |
|---|
| 4 | | Masahiro Kumabe:
Generic Degrees are Complemented.
Ann. Pure Appl. Logic 59(3): 257-272 (1993) |
| 3 | | Masahiro Kumabe:
Every n-Generic Degree Is a Minimal Cover of an n-Generic Degree.
J. Symb. Log. 58(1): 219-231 (1993) |
| 1991 |
|---|
| 2 | | Masahiro Kumabe:
Relative Recursive Enumerability of Generic Degrees.
J. Symb. Log. 56(3): 1075-1084 (1991) |
| 1990 |
|---|
| 1 | | Masahiro Kumabe:
A 1-Generic Degree which Bounds a Minimal Degree.
J. Symb. Log. 55(2): 733-743 (1990) |
