The following pages link to Harold T. Hodes (Q792996):
Displayed 26 items.
- Some theorems on the expressive limitations of modal languages (Q792997) (← links)
- Axioms for actuality (Q792998) (← links)
- A minimal upper bound on a sequence of Turing degrees which represents that sequence (Q798318) (← links)
- On modal logics which enrich first-order S5 (Q801894) (← links)
- Item:Q792996 (redirect page) (← links)
- Individual-actualism and three-valued modal logics. I: Model-theoretic semantics (Q1092031) (← links)
- Individual-actualism and three-valued modal logics. II. Natural-deduction formalizations (Q1103608) (← links)
- Cardinality logics. I: Inclusions between languages based on ``exactly'' (Q1107521) (← links)
- Three-valued logics: An introduction, a comparison of various logical lexica, and some philosophical remarks (Q1123187) (← links)
- Where do the natural numbers come from? (Q1202499) (← links)
- One-step modal logics, intuitionistic and classical. I (Q2240542) (← links)
- One-step modal logics, intuitionistic and classical. II (Q2240543) (← links)
- Why ramify? (Q2354627) (← links)
- (Q2931097) (← links)
- (Q3317082) (← links)
- THE MODAL THEORY OF PURE IDENTITY AND SOME RELATED DECISION PROBLEMS (Q3337451) (← links)
- More about uniform upper bounds on ideals of turing degrees (Q3659771) (← links)
- Well-behaved modal logics (Q3714055) (← links)
- Finite level Borel games and a problem concerning the jump hierarchy (Q3715102) (← links)
- Cardinality logics. Part II: Definability in languages based on ‘exactly’ (Q3820583) (← links)
- Jumping through the transfinite: the master code hierarchy of Turing degrees (Q3882445) (← links)
- Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy (Q3941395) (← links)
- Jumping to a Uniform Upper Bound (Q3962989) (← links)
- Where do sets come from? (Q3981451) (← links)
- Uniform upper bounds on ideals of turing degrees (Q4170709) (← links)
- Cut‐conditions on sets of multiple‐alternative inferences (Q6094136) (← links)