default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlistair H. Lachlan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j32]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)
1990 – 1999
- 1998
- [j31]Alistair H. Lachlan, Robert I. Soare:
Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets. J. Symb. Log. 63(1): 59-72 (1998) - [j30]Seema Ahmad, Alistair H. Lachlan:
Some Special Pairs Of Σ2 e-Degrees. Math. Log. Q. 44: 431-449 (1998) - 1995
- [j29]Reza Akhtar, Alistair H. Lachlan:
On countable homogeneous 3-hypergraphs. Arch. Math. Log. 34(5): 331-344 (1995) - [j28]Allyson Tripp, Alistair H. Lachlan:
Finite Homogeneous 3-Graphs. Math. Log. Q. 41: 287-306 (1995) - 1994
- [j27]Alistair H. Lachlan, Robert I. Soare:
Models of Arithmetic and Upper Bounds for Arithmetic Sets. J. Symb. Log. 59(3): 977-983 (1994) - 1993
- [j26]Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare:
The Continuity of Cupping to 0'. Ann. Pure Appl. Log. 64(3): 195-209 (1993) - [j25]Xiaoding Yi, Alistair H. Lachlan:
Jump Theorems for REA Operators. Math. Log. Q. 39: 1-6 (1993) - 1992
- [j24]Alistair H. Lachlan, Richard A. Shore:
Then-rea enumeration degrees are dense. Arch. Math. Log. 31(4): 277-285 (1992) - [j23]Alistair H. Lachlan:
aleph0-Categorical Tree-Decomposable Structures. J. Symb. Log. 57(2): 501-514 (1992) - 1991
- [j22]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) - 1990
- [j21]Alistair H. Lachlan:
Some coinductive graphs. Arch. Math. Log. 29(4): 213-229 (1990)
1980 – 1989
- 1987
- [j20]Alistair H. Lachlan:
Structures coordinatized by indiscernible sets. Ann. Pure Appl. Log. 34(3): 245-273 (1987) - [j19]Alistair H. Lachlan:
Complete Theories with Only Universal and Existential Axioms. J. Symb. Log. 52(3): 698-711 (1987) - [j18]Alistair H. Lachlan:
A Note on Positive Equivalence Relations. Math. Log. Q. 33(1): 43-46 (1987) - [j17]Akira Kanda, Alistair H. Lachlan:
Alternative Characterizations of Precomplete Numerations. Math. Log. Q. 33(2): 97-100 (1987) - 1985
- [j16]Gregory L. Cherlin, Leo Harrington, Alistair H. Lachlan:
aleph0-Categorical, aleph0-stable structures. Ann. Pure Appl. Log. 28(2): 103-135 (1985) - 1984
- [j15]Julia F. Knight, Alistair H. Lachlan, Robert I. Soare:
Two Theorems on Degrees of Models of True Arithmetic. J. Symb. Log. 49(2): 425-436 (1984) - [j14]Michal Krynicki, Alistair H. Lachlan, Jouko Väänänen:
Vector spaces and binary quantifiers. Notre Dame J. Formal Log. 25(1): 72-78 (1984)
1970 – 1979
- 1979
- [j13]Michal Krynicki, Alistair H. Lachlan:
On the Semantics of the Henkin Quantifier. J. Symb. Log. 44(2): 184-200 (1979) - [j12]Alistair H. Lachlan:
Bounding Minimal Pairs. J. Symb. Log. 44(4): 626-642 (1979) - 1978
- [j11]Alistair H. Lachlan:
Spectra of ω-Stable Theories. Math. Log. Q. 24(9-11): 129-139 (1978) - 1976
- [j10]Alistair H. Lachlan, R. Lebeuf:
Countable Initial Segments of the Degrees of Unsolvability. J. Symb. Log. 41(2): 289-300 (1976) - 1975
- [j9]Alistair H. Lachlan:
Uniform Enumeration Operations. J. Symb. Log. 40(3): 401-409 (1975) - [j8]Alistair H. Lachlan:
A remark on the strict order property. Math. Log. Q. 21(1): 69-70 (1975) - 1971
- [j7]John T. Baldwin, Alistair H. Lachlan:
On Strongly Minimal Sets. J. Symb. Log. 36(1): 79-96 (1971)
1960 – 1969
- 1968
- [j6]Alistair H. Lachlan:
Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets. J. Symb. Log. 33(3): 431-443 (1968) - 1966
- [j5]Alistair H. Lachlan:
On the Indexing of Classes of Recursively Enumerable Sets. J. Symb. Log. 31(1): 10-22 (1966) - [j4]Alistair H. Lachlan:
The Impossibility of finding Relative Complements for Recursively Enumerable Degrees. J. Symb. Log. 31(3): 434-454 (1966) - [j3]Alistair H. Lachlan:
A Note on Universal Sets. J. Symb. Log. 31(4): 573-574 (1966) - 1964
- [j2]Alistair H. Lachlan:
Effective Operations in a General Setting. J. Symb. Log. 29(4): 163-178 (1964) - 1963
- [j1]Alistair H. Lachlan:
Recursive Real Numbers. J. Symb. Log. 28(1): 1-16 (1963)
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 22:46 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:
