Concepedia
Statistics
Publications
47
Citations
2.2K
H-Index
28
Active since
1964
Affiliations
Simon Fraser University(Current)
University of Chicago
Hebrew University of Jerusalem
Newcastle upon Tyne Hospital
A. H. Lachlan is an author at Simon Fraser University specializing in discrete mathematics, automated reasoning, and engineering.
Top concepts
Discrete MathematicsEngineeringAutomated ReasoningFormal MethodsComputational ComplexityComputer ScienceSyntaxGrammarLanguageSemantics
Publications per year
1964–1998
Lower Bounds for Pairs of Recursively Enumerable Degrees
A. H. Lachlan · Proceedings of the London Mathematical Society · 1966 · 220 citations
Lower Bound, Computational Complexity, Extremal Combinatorics +3
On strongly minimal sets
John T. Baldwin, A. H. Lachlan · Journal of Symbolic Logic · 1971 · 217 citations
Principal Extension, Extremal Set Theory, Model Theory +6
On the lattice of recursively enumerable sets
A. H. Lachlan · Transactions of the American Mathematical Society · 1968 · 148 citations · Full text
New Theorems, Algebraic Logic, Engineering +13
Countable homogeneous tournaments
A. H. Lachlan · Transactions of the American Mathematical Society · 1984 · 114 citations
Math Xmlns, Combinatorics On Word, Homogeneous Tournaments +7
A recursively enumerable degree which will not split over all lesser ones
A. H. Lachlan · Annals of Mathematical Logic · 1976 · 107 citations
Lesser Ones, Recursive Function, Enumerable Degree +1
1–5 of 47