Harold T. Hodes - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2022

Cut-conditions on sets of multiple-alternative inferencesHarold T. Hodes. mlq, 68(1):95-106, 2022. [doi]

2021

One-Step Modal Logics, Intuitionistic and Classical, Part 1Harold T. Hodes. jphil, 50(5):837-872, 2021. [doi]

One-Step Modal Logics, Intuitionistic and Classical, Part 2Harold T. Hodes. jphil, 50(5):873-910, 2021. [doi]

2015

Why Ramify?Harold T. Hodes. ndjfl, 56(2):379-415, 2015. [doi]

1991

Where Do Sets Come From?Harold T. Hodes. JSYML, 56(1):150-175, 1991.

Corrections to Where Do Sets Come From? Harold T. Hodes. JSYML, 56(4):1486, 1991.

1988

Annual Meeting of the Association for Symbolic Logic, New York City, December 1987Nicolas D. Goodman, Harold T. Hodes, Carl G. Jockusch Jr., Kenneth McAloon. JSYML, 53(4):1287-1299, 1988.

1984

Finite Level Borel Games and a Problem Concerning the Jump HierarchyHarold T. Hodes. JSYML, 49(4):1301-1318, 1984.

Well-Behaved Modal LogicsHarold T. Hodes. JSYML, 49(4):1393-1402, 1984.

Axioms for actualityHarold T. Hodes. jphil, 13(1):27-34, 1984. [doi]

Some theorems on the expressive limitations of modal languagesHarold T. Hodes. jphil, 13(1):13-26, 1984. [doi]

The Modal Theory of Pure Identity and Some Related Decision ProblemsHarold T. Hodes. mlq, 30(26-29):415-423, 1984. [doi]

1983

More About Uniform Upper Bounds on Ideals of Turing DegreesHarold T. Hodes. JSYML, 48(2):441-457, 1983.

1981

Upper Bounds on Locally Countable Admissible Initial Segments of a Turing Degree HierarchyHarold T. Hodes. JSYML, 46(4):753-760, 1981.

1980

Jumping Through the Transfinite: The Master Code Hierarchy of Turing DegreesHarold T. Hodes. JSYML, 45(2):204-220, 1980.

1978

Uniform Upper Bounds on Ideals of Turing DegreesHarold T. Hodes. JSYML, 43(3):601-612, 1978.

Sign in or sign up to see more results.

runs on WebDSL