Alistair H. Lachlan

Available identifiers

zbMath Open lachlan.alistair-hMaRDI QIDQ1182486

List of research outcomes

Publication	Date of Publication	Type
Corrigendum to: ``The d.r.e. degrees are not dense	2017-09-29	Paper
Some Special Pairs of Σ2 e-Degrees	1999-04-27	Paper
Models of arithmetic and subuniform bounds for the arithmetic sets	1998-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q4355923	1997-12-11	Paper
Jump Theorems for REA Operators	1997-01-13	Paper
On countable homogeneous \(3\)-hypergraphs	1996-03-06	Paper
Finite Homogeneous 3‐Graphs	1996-01-28	Paper
The continuity of cupping to \(\text \textbf{0}'\)	1995-01-29	Paper
Models of arithmetic and upper bounds for arithmetic sets	1994-11-27	Paper
The \(n\)-rea enumeration degrees are dense	1993-09-01	Paper
Obituary: Alan Mekler	1993-06-29	Paper
ℵ0-categorical tree-decomposable structures	1993-04-01	Paper
The d.r.e. degrees are not dense	1992-06-28	Paper
Complete Coinductive Theorems. II	1992-06-27	Paper
Some coinductive graphs	1990-01-01	Paper
Complete Coinductive Theories. I	1990-01-01	Paper
A Remark on Pseudo-Jump Operators	1989-01-01	Paper
Structures coordinatized by indiscernible sets	1987-01-01	Paper
A Note on Positive Equivalence Relations	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3032236	1987-01-01	Paper
Alternative Characterizations of Precomplete Numerations	1987-01-01	Paper
Complete theories with only universal and existential axioms	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3813800	1987-01-01	Paper
Binary Homogeneous Structures I	1986-01-01	Paper
Binary Homogeneous Structures II	1986-01-01	Paper
Stable Finitely Homogeneous Structures	1986-01-01	Paper
\(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures	1985-01-01	Paper
Vector spaces and binary quantifiers	1984-01-01	Paper
On countable stable structures which are homogeneous for a finite relational language	1984-01-01	Paper
Stable structures homogeneous for a finite binary language	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3343969	1984-01-01	Paper
Two theorems on degrees of models of true arithmetic	1984-01-01	Paper
Countable Homogeneous Tournaments	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3666878	1982-01-01	Paper
Construction of Satisfaction Classes for Nonstandard Models	1981-01-01	Paper
Full Satisfaction Classes and Recursive Saturation	1981-01-01	Paper
Not every finite lattice is embeddable in the recursively enumerable degrees	1980-01-01	Paper
Decomposition of Recursively Enumerable Degrees	1980-01-01	Paper
Countable Ultrahomogeneous Undirected Graphs	1980-01-01	Paper
Singular properties of Morley rank	1980-01-01	Paper
On the semantics of the Henkin quantifier	1979-01-01	Paper
Bounding minimal pairs	1979-01-01	Paper
Spectra of ω‐Stable Theories	1978-01-01	Paper
Skolem Functions and Elementary Extensions	1978-01-01	Paper
Possible Orderings of an Indiscernible Sequence	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4113827	1976-01-01	Paper
A recursively enumerable degree which will not split over all lesser ones	1976-01-01	Paper
Countable initial segments of the degrees of unsolvability	1976-01-01	Paper
Theories with a finite number of models in an uncountable power are categorical	1975-01-01	Paper
A note on Thomason's refined structures for tense logics	1975-01-01	Paper
A remark on the strict order property	1975-01-01	Paper
w tt-Complete Sets are not Necessarily tt-Complete	1975-01-01	Paper
Uniform enumeration operations	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3895453	1974-01-01	Paper
Two conjectures regarding the stability of ω-categorical theories	1974-01-01	Paper
On universal Horn classes categorical in some infinite power	1973-01-01	Paper
Two theorems on many-one degrees of recursively enumerable sets	1973-01-01	Paper
Recursively enumerable many-one degrees	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4404866	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5670617	1972-01-01	Paper
A property of stable theories	1972-01-01	Paper
The transcendental rank of a theory	1971-01-01	Paper
Solution to a Problem of Spector	1971-01-01	Paper
On strongly minimal sets	1971-01-01	Paper
On some games which are relevant to the theory of recursively enumerable sets	1970-01-01	Paper
Initial Segments of Many-One Degrees	1970-01-01	Paper
Computable Fields and Arithmetically Definable Ordered Fields	1970-01-01	Paper
Initial segments of one-one degrees	1969-01-01	Paper
The elementary theory of recursively enumerable sets	1968-01-01	Paper
On the Lattice of Recursively Enumerable Sets	1968-01-01	Paper
Complete Recursively Enumerable Sets	1968-01-01	Paper
Distributive Initial Segments of the Degrees of Unsolvability	1968-01-01	Paper
Degrees of recursively enumerable sets which have no maximal supersets	1968-01-01	Paper
The Priority Method I	1967-01-01	Paper
On Recursive Enumeration Without Repetition: A Correction	1967-01-01	Paper
On the indexing of classes of recursively enumerable sets	1966-01-01	Paper
Lower Bounds for Pairs of Recursively Enumerable Degrees	1966-01-01	Paper
The impossibility of finding relative complements for recursively enumerable degrees	1966-01-01	Paper
A note on universal sets	1966-01-01	Paper
On a Problem of G. E. Sacks	1965-01-01	Paper
Some Notions of Reducibility and Productiveness	1965-01-01	Paper
On Recursive Enumeration Without Repetition	1965-01-01	Paper
Effective Inseparability for Sequences of Sets	1965-01-01	Paper
STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS	1964-01-01	Paper
Recursive real numbers	1964-01-01	Paper
Effective operations in a general setting	1964-01-01	Paper
A note on the elementary α-perceptron	1964-01-01	Paper
Multiple Recursion	1962-01-01	Paper
The U‐Quantifier	1961-01-01	Paper

Research outcomes over time

This page was built for person: Alistair H. Lachlan