Masahiro Kumabe

According to our database1, Masahiro Kumabe authored at least 13 papers between 1990 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Resource-bounded martingales and computable Dowd-type generic sets.
Inf. Comput., 2015

2011
Preference aggregation theory without acyclicity: The core without majority dissatisfaction.
Games Econ. Behav., 2011

Computability of simple games: A complete investigation of the sixty-four possibilities
CoRR, 2011

2008
The Nakamura numbers for computable simple games.
Soc. Choice Welf., 2008

Does truth-table of linear norm reduce the one-query tautologies to a random oracle?
Arch. Math. Log., 2008

2007
Computability of simple games: A characterization and application to the core
CoRR, 2007

2000
A 1-Generic Degree with A Strong Minimal Cover.
J. Symb. Log., 2000

1996
Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees.
J. Symb. Log., 1996

1994
Minimal Upper Bounds for Arithmetical Degrees.
J. Symb. Log., 1994

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

Generic Degrees are Complemented.
Ann. Pure Appl. Log., 1993

1991
Relative Recursive Enumerability of Generic Degrees.
J. Symb. Log., 1991

1990
A 1-Generic Degree which Bounds a Minimal Degree.
J. Symb. Log., 1990


  Loading...