default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeo Harrington
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j24]S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare:
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. Ann. Pure Appl. Log. 168(12): 2164-2165 (2017)- [c2]Leo Harrington, Richard A. Shore, Theodore A. Slaman:
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Computability and Complexity 2017: 455-466
2000 – 2009
- 2008
- [j23]Peter Cholak, Rodney G. Downey, Leo Harrington:
The Complexity of Orbits of Computably Enumerable Sets. Bull. Symb. Log. 14(1): 69-87 (2008) - 2003
- [j22]Peter Cholak, Leo Harrington:
Isomorphisms of splits of computably enumerable sets. J. Symb. Log. 68(3): 1044-1064 (2003) - 2002
- [j21]Peter A. Cholak, Leo Harrington:
On the Definability of the double jump in the computably Enumerable Sets. J. Math. Log. 2(2) (2002) - 2000
- [j20]Peter Cholak, Leo Harrington:
Definable encodings in the computably enumerable sets. Bull. Symb. Log. 6(2): 185-196 (2000)
1990 – 1999
- 1998
- [j19]Leo Harrington, Robert I. Soare:
Definable Properties of the Computably Enumerable Sets. Ann. Pure Appl. Log. 94(1-3): 97-125 (1998) - [j18]Leo Harrington, Robert I. Soare:
Codable Sets and Orbits of Computably Enumerable Sets. J. Symb. Log. 63(1): 1-28 (1998) - 1996
- [j17]Rodney G. Downey, Leo Harrington:
There is No Fat Orbit. Ann. Pure Appl. Log. 80(3): 277-289 (1996) - [j16]Leo Harrington, Robert I. Soare:
Definability, automorphisms, and dynamic properties of computably enumerable sets. Bull. Symb. Log. 2(2): 199-213 (1996) - 1991
- [j15]S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare:
The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Log. 55(2): 125-151 (1991)
1980 – 1989
- 1987
- [j14]John T. Baldwin, Leo Harrington:
Trivial pursuit: Remarks on the main gap. Ann. Pure Appl. Log. 34(3): 209-230 (1987) - 1985
- [j13]Gregory L. Cherlin, Leo Harrington, Alistair H. Lachlan:
aleph0-Categorical, aleph0-stable structures. Ann. Pure Appl. Log. 28(2): 103-135 (1985) - [j12]Leo Harrington, Michael Makkai:
An exposition of Shelah's "main gap": counting uncountable models of ω-stable and superstable theories. Notre Dame J. Formal Log. 26(2): 139-177 (1985) - [j11]Leo Harrington, Saharon Shelah
:
Some exact equiconsistency results in set theory. Notre Dame J. Formal Log. 26(2): 178-188 (1985) - 1984
- [j10]Victor Harnik, Leo Harrington:
Fundamentals of forking. Ann. Pure Appl. Log. 26(3): 245-286 (1984) - 1982
- [c1]Yuri Gurevich, Leo Harrington:
Trees, Automata, and Games. STOC 1982: 60-65 - 1980
- [j9]Leo Harrington:
Extensions of countable infinitary logic which preserve most of its nice properties. Arch. Math. Log. 20(3-4): 95-102 (1980)
1970 – 1979
- 1978
- [j8]Fred G. Abramson, Leo Harrington:
Models Without Indiscernibles. J. Symb. Log. 43(3): 572-600 (1978) - [j7]Leo Harrington:
Analytic Determinacy and 0 #. J. Symb. Log. 43(4): 685-693 (1978) - 1977
- [j6]Solomon Feferman, Jon Barwise, Leo Harrington:
Meeting of the Association for Symbolic Logic: Reno, 1976. J. Symb. Log. 42(1): 156-160 (1977) - 1976
- [j5]Leo Harrington, David B. MacQueen:
Selection in Abstract Recursion Theory. J. Symb. Log. 41(1): 153-158 (1976) - [j4]Leo Harrington, Thomas Jech:
On sigma1 Well-Orderings of the Universe. J. Symb. Log. 41(1): 167-170 (1976) - [j3]James E. Baumgartner, Leo Harrington, E. M. Kleinberg:
Adding a Closed Unbounded Set. J. Symb. Log. 41(2): 481-482 (1976) - 1975
- [j2]Leo Harrington, Alexander S. Kechris:
On Characterizing Spector Classes. J. Symb. Log. 40(1): 19-24 (1975) - 1974
- [j1]Leo Harrington:
Recursively Presentable Prime Models. J. Symb. Log. 39(2): 305-309 (1974)
Coauthor Index
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:18 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:
