1998 |
21 | | Alistair H. Lachlan,
Robert I. Soare:
Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets.
J. Symb. Log. 63(1): 59-72 (1998) |
20 | | Seema Ahmad,
Alistair H. Lachlan:
Some Special Pairs Of Sigma2 e-Degrees.
Math. Log. Q. 44: 431-449 (1998) |
1995 |
19 | | Allyson Tripp,
Alistair H. Lachlan:
Finite Homogeneous 3-Graphs.
Math. Log. Q. 41: 287-306 (1995) |
1994 |
18 | | Alistair H. Lachlan,
Robert I. Soare:
Models of Arithmetic and Upper Bounds for Arithmetic Sets.
J. Symb. Log. 59(3): 977-983 (1994) |
1993 |
17 | | Klaus Ambos-Spies,
Alistair H. Lachlan,
Robert I. Soare:
The Continuity of Cupping to 0'.
Ann. Pure Appl. Logic 64(3): 195-209 (1993) |
16 | | Xiaoding Yi,
Alistair H. Lachlan:
Jump Theorems for REA Operators.
Math. Log. Q. 39: 1-6 (1993) |
1992 |
15 | | Alistair H. Lachlan:
aleph0-Categorical Tree-Decomposable Structures.
J. Symb. Log. 57(2): 501-514 (1992) |
1991 |
14 | | S. Barry Cooper,
Leo Harrington,
Alistair H. Lachlan,
Steffen Lempp,
Robert I. Soare:
The d.r.e. Degrees are Not Dense.
Ann. Pure Appl. Logic 55(2): 125-151 (1991) |
1987 |
13 | | Alistair H. Lachlan:
Complete Theories with Only Universal and Existential Axioms.
J. Symb. Log. 52(3): 698-711 (1987) |
1984 |
12 | | 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) |
1979 |
11 | | Michal Krynicki,
Alistair H. Lachlan:
On the Semantics of the Henkin Quantifier.
J. Symb. Log. 44(2): 184-200 (1979) |
10 | | Alistair H. Lachlan:
Bounding Minimal Pairs.
J. Symb. Log. 44(4): 626-642 (1979) |
1976 |
9 | | Alistair H. Lachlan,
R. Lebeuf:
Countable Initial Segments of the Degrees of Unsolvability.
J. Symb. Log. 41(2): 289-300 (1976) |
1975 |
8 | | Alistair H. Lachlan:
Uniform Enumeration Operations.
J. Symb. Log. 40(3): 401-409 (1975) |
1971 |
7 | | John T. Baldwin,
Alistair H. Lachlan:
On Strongly Minimal Sets.
J. Symb. Log. 36(1): 79-96 (1971) |
1968 |
6 | | Alistair H. Lachlan:
Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets.
J. Symb. Log. 33(3): 431-443 (1968) |
1966 |
5 | | Alistair H. Lachlan:
On the Indexing of Classes of Recursively Enumerable Sets.
J. Symb. Log. 31(1): 10-22 (1966) |
4 | | Alistair H. Lachlan:
The Impossibility of finding Relative Complements for Recursively Enumerable Degrees.
J. Symb. Log. 31(3): 434-454 (1966) |
3 | | Alistair H. Lachlan:
A Note on Universal Sets.
J. Symb. Log. 31(4): 573-574 (1966) |
1964 |
2 | | Alistair H. Lachlan:
Effective Operations in a General Setting.
J. Symb. Log. 29(4): 163-178 (1964) |
1963 |
1 | | Alistair H. Lachlan:
Recursive Real Numbers.
J. Symb. Log. 28(1): 1-16 (1963) |