default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarold T. Hodes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j23]Harold T. Hodes
:
Cut-conditions on sets of multiple-alternative inferences. Math. Log. Q. 68(1): 95-106 (2022)- 2021
- [j22]Harold T. Hodes:
One-Step Modal Logics, Intuitionistic and Classical, Part 1. J. Philos. Log. 50(5): 837-872 (2021) - [j21]Harold T. Hodes:
One-Step Modal Logics, Intuitionistic and Classical, Part 2. J. Philos. Log. 50(5): 873-910 (2021)
2010 – 2019
- 2015
- [j20]Harold T. Hodes:
Why Ramify? Notre Dame J. Formal Log. 56(2): 379-415 (2015)
1990 – 1999
- 1991
- [j19]Harold T. Hodes:
Where Do Sets Come From? J. Symb. Log. 56(1): 150-175 (1991) - [j18]Harold T. Hodes:
Corrections to "Where Do Sets Come From?". J. Symb. Log. 56(4): 1486 (1991)
1980 – 1989
- 1989
- [j17]Harold Hodes:
Three-Valued Logics: An Introduction, a Comparison of Various Logical Lexica, and Some Philosophical Remarks. Ann. Pure Appl. Log. 43(2): 99-145 (1989) - 1988
- [j16]Harold Hodes:
Cardinality logics, part I: inclusions between languages based on 'exactly'. Ann. Pure Appl. Log. 39(3): 199-238 (1988) - [j15]Harold Hodes:
Cardinality Logics. Part II: Definability in Languages Based on 'Exactly'. J. Symb. Log. 53(3): 765-784 (1988) - [j14]Nicolas D. Goodman, Harold T. Hodes, Carl G. Jockusch Jr., Kenneth McAloon:
Annual Meeting of the Association for Symbolic Logic, New York City, December 1987. J. Symb. Log. 53(4): 1287-1299 (1988) - 1987
- [j13]Harold Hodes:
Individual-actualism and three-valued modal logics, part 2: Natural-deduction formalizations. J. Philos. Log. 16(1): 17-63 (1987) - 1986
- [j12]Harold Hodes:
Individual-actualism and three-valued modal logics, part 1: Model-theoretic semantics. J. Philos. Log. 15(4): 369-401 (1986) - 1984
- [j11]Harold T. Hodes:
Some theorems on the expressive limitations of modal languages. J. Philos. Log. 13(1): 13-26 (1984) - [j10]Harold T. Hodes:
Axioms for actuality. J. Philos. Log. 13(1): 27-34 (1984) - [j9]Harold Hodes:
On modal logics which enrich first-order S5. J. Philos. Log. 13(4): 423-454 (1984) - [j8]Harold T. Hodes:
Finite Level Borel Games and a Problem Concerning the Jump Hierarchy. J. Symb. Log. 49(4): 1301-1318 (1984) - [j7]Harold T. Hodes:
Well-Behaved Modal Logics. J. Symb. Log. 49(4): 1393-1402 (1984) - [j6]Harold T. Hodes:
The Modal Theory of Pure Identity and Some Related Decision Problems. Math. Log. Q. 30(26-29): 415-423 (1984) - 1983
- [j5]Harold T. Hodes:
More About Uniform Upper Bounds on Ideals of Turing Degrees. J. Symb. Log. 48(2): 441-457 (1983) - 1981
- [j4]George Boolos, Sy D. Friedman, Harold Hodes:
Meeting of the Association for Symbolic Logic: New York 1979. J. Symb. Log. 46(2): 427-434 (1981) - [j3]Harold T. Hodes:
Upper Bounds on Locally Countable Admissible Initial Segments of a Turing Degree Hierarchy. J. Symb. Log. 46(4): 753-760 (1981) - 1980
- [j2]Harold T. Hodes:
Jumping Through the Transfinite: The Master Code Hierarchy of Turing Degrees. J. Symb. Log. 45(2): 204-220 (1980)
1970 – 1979
- 1978
- [j1]Harold T. Hodes:
Uniform Upper Bounds on Ideals of Turing Degrees. J. Symb. Log. 43(3): 601-612 (1978)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
