Recursive Real Numbers. - Alistair H. Lachlan (J. Symb. Log., 1963)

Effective Operations in a General Setting. - Alistair H. Lachlan (J. Symb. Log., 1964)

On the Indexing of Classes of Recursively Enumerable Sets. - Alistair H. Lachlan (J. Symb. Log., 1966)

The Impossibility of finding Relative Complements for Recursively Enumerable Degrees. - Alistair H. Lachlan (J. Symb. Log., 1966)

A Note on Universal Sets. - Alistair H. Lachlan (J. Symb. Log., 1966)

Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets. - Alistair H. Lachlan (J. Symb. Log., 1968)

On Strongly Minimal Sets. - John T. Baldwin 001; Alistair H. Lachlan (J. Symb. Log., 1971)

Uniform Enumeration Operations. - Alistair H. Lachlan (J. Symb. Log., 1975)

A remark on the strict order property. - Alistair H. Lachlan (Math. Log. Q., 1975)

Countable Initial Segments of the Degrees of Unsolvability. - Alistair H. Lachlan; R. Lebeuf (J. Symb. Log., 1976)

Spectra of ω-Stable Theories. - Alistair H. Lachlan (Math. Log. Q., 1978)

On the Semantics of the Henkin Quantifier. - Michal Krynicki; Alistair H. Lachlan (J. Symb. Log., 1979)

Bounding Minimal Pairs. - Alistair H. Lachlan (J. Symb. Log., 1979)

Two Theorems on Degrees of Models of True Arithmetic. - Julia F. Knight; Alistair H. Lachlan; Robert I. Soare (J. Symb. Log., 1984)

Vector spaces and binary quantifiers. - Michal Krynicki; Alistair H. Lachlan; Jouko Väänänen (Notre Dame J. Formal Log., 1984)

aleph0-Categorical, aleph0-stable structures. - Gregory L. Cherlin; Leo Harrington; Alistair H. Lachlan (Ann. Pure Appl. Log., 1985)

Structures coordinatized by indiscernible sets. - Alistair H. Lachlan (Ann. Pure Appl. Log., 1987)

Complete Theories with Only Universal and Existential Axioms. - Alistair H. Lachlan (J. Symb. Log., 1987)

Alternative Characterizations of Precomplete Numerations. - Akira Kanda; Alistair H. Lachlan (Math. Log. Q., 1987)

A Note on Positive Equivalence Relations. - Alistair H. Lachlan (Math. Log. Q., 1987)

Some coinductive graphs. - Alistair H. Lachlan (Arch. Math. Log., 1990)

The d.r.e. Degrees are Not Dense. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 1991)

Then-rea enumeration degrees are dense. - Alistair H. Lachlan; Richard A. Shore (Arch. Math. Log., 1992)

aleph0-Categorical Tree-Decomposable Structures. - Alistair H. Lachlan (J. Symb. Log., 1992)

The Continuity of Cupping to 0'. - Klaus Ambos-Spies; Alistair H. Lachlan; Robert I. Soare (Ann. Pure Appl. Log., 1993)

Jump Theorems for REA Operators. - Xiaoding Yi; Alistair H. Lachlan (Math. Log. Q., 1993)

Models of Arithmetic and Upper Bounds for Arithmetic Sets. - Alistair H. Lachlan; Robert I. Soare (J. Symb. Log., 1994)

On countable homogeneous 3-hypergraphs. - Reza Akhtar; Alistair H. Lachlan (Arch. Math. Log., 1995)

Finite Homogeneous 3-Graphs. - Allyson Tripp; Alistair H. Lachlan (Math. Log. Q., 1995)

Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets. - Alistair H. Lachlan; Robert I. Soare (J. Symb. Log., 1998)

Some Special Pairs Of Σ2 e-Degrees. - Seema Ahmad; Alistair H. Lachlan (Math. Log. Q., 1998)

Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 2017)