Alistair H. Lachlan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2017

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. APAL, 168(12):2164-2165, 2017. [doi]

1998

Some Special Pairs Of Sigma::2:: e-DegreesSeema Ahmad, Alistair H. Lachlan. mlq, 44:431-449, 1998.

Models of Arithmetic and Subuniform Bounds for the Arithmetic SetsAlistair H. Lachlan, Robert I. Soare. JSYML, 63(1):59-72, 1998.

1995

On countable homogeneous 3-hypergraphsReza Akhtar, Alistair H. Lachlan. AML, 34(5):331-344, 1995. [doi]

Finite Homogeneous 3-GraphsAllyson Tripp, Alistair H. Lachlan. mlq, 41:287-306, 1995.

1994

Models of Arithmetic and Upper Bounds for Arithmetic SetsAlistair H. Lachlan, Robert I. Soare. JSYML, 59(3):977-983, 1994.

1993

The Continuity of Cupping to 0 Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare. APAL, 64(3):195-209, 1993.

Jump Theorems for REA OperatorsXiaoding Yi, Alistair H. Lachlan. mlq, 39:1-6, 1993.

1992

aleph::0::-Categorical Tree-Decomposable StructuresAlistair H. Lachlan. JSYML, 57(2):501-514, 1992.

n-rea enumeration degrees are denseAlistair H. Lachlan, Richard A. Shore. AML, 31(4):277-285, 1992. [doi]

1991

The d.r.e. Degrees are Not DenseS. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare. APAL, 55(2):125-151, 1991.

1990

Some coinductive graphsAlistair H. Lachlan. AML, 29(4):213-229, 1990. [doi]

1987

Alternative Characterizations of Precomplete NumerationsAkira Kanda, Alistair H. Lachlan. mlq, 33(2):97-100, 1987. [doi]

Complete Theories with Only Universal and Existential AxiomsAlistair H. Lachlan. JSYML, 52(3):698-711, 1987.

Structures coordinatized by indiscernible setsAlistair H. Lachlan. APAL, 34(3):245-273, 1987. [doi]

A Note on Positive Equivalence RelationsAlistair H. Lachlan. mlq, 33(1):43-46, 1987. [doi]

1985

0-stable structuresG. Cherlin, Leo Harrington, Alistair H. Lachlan. APAL, 28(2):103-135, 1985. [doi]

1984

Two Theorems on Degrees of Models of True ArithmeticJulia F. Knight, Alistair H. Lachlan, Robert I. Soare. JSYML, 49(2):425-436, 1984.

Vector spaces and binary quantifiersMichal Krynicki, Alistair H. Lachlan, Jouko Väänänen. ndjfl, 25(1):72-78, 1984. [doi]

1979

On the Semantics of the Henkin QuantifierMichal Krynicki, Alistair H. Lachlan. JSYML, 44(2):184-200, 1979.

Bounding Minimal PairsAlistair H. Lachlan. JSYML, 44(4):626-642, 1979.

1978

Spectra of ω-Stable TheoriesAlistair H. Lachlan. mlq, 24(9-11):129-139, 1978. [doi]

1976

Countable Initial Segments of the Degrees of UnsolvabilityAlistair H. Lachlan, R. Lebeuf. JSYML, 41(2):289-300, 1976.

1975

Uniform Enumeration OperationsAlistair H. Lachlan. JSYML, 40(3):401-409, 1975.

A remark on the strict order propertyAlistair H. Lachlan. mlq, 21(1):69-70, 1975. [doi]

1971

On Strongly Minimal SetsJohn T. Baldwin, Alistair H. Lachlan. JSYML, 36(1):79-96, 1971.

1968

Degrees of Recursively Enumerable Sets Which Have No Maximal SupersetsAlistair H. Lachlan. JSYML, 33(3):431-443, 1968.

1966

A Note on Universal SetsAlistair H. Lachlan. JSYML, 31(4):573-574, 1966.

The Impossibility of finding Relative Complements for Recursively Enumerable DegreesAlistair H. Lachlan. JSYML, 31(3):434-454, 1966.

On the Indexing of Classes of Recursively Enumerable SetsAlistair H. Lachlan. JSYML, 31(1):10-22, 1966.

1964

Effective Operations in a General SettingAlistair H. Lachlan. JSYML, 29(4):163-178, 1964.

1963

Recursive Real NumbersAlistair H. Lachlan. JSYML, 28(1):1-16, 1963.

Sign in or sign up to see more results.

runs on WebDSL