The SCEAS System
| |||||||

## Search the dblp DataBase
Alistair H. Lachlan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare
**The Continuity of Cupping to 0'.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1993, v:64, n:3, pp:195-209 [Journal] - S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
**The d.r.e. Degrees are Not Dense.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1991, v:55, n:2, pp:125-151 [Journal] - John T. Baldwin, Alistair H. Lachlan
**On Strongly Minimal Sets.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1971, v:36, n:1, pp:79-96 [Journal] - Julia F. Knight, Alistair H. Lachlan, Robert I. Soare
**Two Theorems on Degrees of Models of True Arithmetic.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1984, v:49, n:2, pp:425-436 [Journal] - Michal Krynicki, Alistair H. Lachlan
**On the Semantics of the Henkin Quantifier.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1979, v:44, n:2, pp:184-200 [Journal] - Alistair H. Lachlan
**Recursive Real Numbers.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1963, v:28, n:1, pp:1-16 [Journal] - Alistair H. Lachlan
**Effective Operations in a General Setting.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1964, v:29, n:4, pp:163-178 [Journal] - Alistair H. Lachlan
**On the Indexing of Classes of Recursively Enumerable Sets.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1966, v:31, n:1, pp:10-22 [Journal] - Alistair H. Lachlan
**The Impossibility of finding Relative Complements for Recursively Enumerable Degrees.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1966, v:31, n:3, pp:434-454 [Journal] - Alistair H. Lachlan
**A Note on Universal Sets.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1966, v:31, n:4, pp:573-574 [Journal] - Alistair H. Lachlan
**Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1968, v:33, n:3, pp:431-443 [Journal] - Alistair H. Lachlan
**Uniform Enumeration Operations.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1975, v:40, n:3, pp:401-409 [Journal] - Alistair H. Lachlan
**Bounding Minimal Pairs.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1979, v:44, n:4, pp:626-642 [Journal] - Alistair H. Lachlan
**Complete Theories with Only Universal and Existential Axioms.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1987, v:52, n:3, pp:698-711 [Journal] - Alistair H. Lachlan
**aleph**[Citation Graph (0, 0)][DBLP]_{0}-Categorical Tree-Decomposable Structures. J. Symb. Log., 1992, v:57, n:2, pp:501-514 [Journal] - Alistair H. Lachlan, R. Lebeuf
**Countable Initial Segments of the Degrees of Unsolvability.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1976, v:41, n:2, pp:289-300 [Journal] - Alistair H. Lachlan, Robert I. Soare
**Models of Arithmetic and Upper Bounds for Arithmetic Sets.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1994, v:59, n:3, pp:977-983 [Journal] - Alistair H. Lachlan, Robert I. Soare
**Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1998, v:63, n:1, pp:59-72 [Journal] - Seema Ahmad, Alistair H. Lachlan
**Some Special Pairs Of Sigma**[Citation Graph (0, 0)][DBLP]_{2}e-Degrees. Math. Log. Q., 1998, v:44, n:, pp:431-449 [Journal] - Xiaoding Yi, Alistair H. Lachlan
**Jump Theorems for REA Operators.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 1993, v:39, n:, pp:1-6 [Journal] - Allyson Tripp, Alistair H. Lachlan
**Finite Homogeneous 3-Graphs.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 1995, v:41, n:, pp:287-306 [Journal]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |