The following pages link to Masahiro Kumabe (Q536090):
Displaying 18 items.
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction (Q536092) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Generic degrees are complemented (Q685063) (← links)
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Resource-bounded martingales and computable Dowd-type generic sets (Q2346413) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- Minimal complementation below uniform upper bounds for the arithmetical degrees (Q3128467) (← links)
- A 1-generic degree which bounds a minimal degree (Q3496331) (← links)
- (Q3567854) (← links)
- A fixed-point-free minimal degree (Q3649154) (← links)
- Relative recursive enumerability of generic degrees (Q3985104) (← links)
- Minimal upper bounds for arithmetical degrees (Q4302349) (← links)
- A 1-generic degree with a strong minimal cover (Q4527930) (← links)
- (Q4863244) (← links)
- COMPUTABLE DOWD-TYPE GENERIC ORACLES (Q4922664) (← links)
- Solovay reducibility and continuity (Q5145846) (← links)
- Every <i>n</i>-generic degree is a minimal cover of an <i>n</i>-generic degree (Q5287689) (← links)
