Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Alistair H. Lachlan - MaRDI portal

Alistair H. Lachlan

From MaRDI portal
(Redirected from Person:795825)
Person:1182486

Available identifiers

zbMath Open lachlan.alistair-hMaRDI QIDQ1182486

List of research outcomes





PublicationDate of PublicationType
Corrigendum to: ``The d.r.e. degrees are not dense2017-09-29Paper
Some Special Pairs of Σ2 e-Degrees1999-04-27Paper
Models of arithmetic and subuniform bounds for the arithmetic sets1998-12-03Paper
https://portal.mardi4nfdi.de/entity/Q43559231997-12-11Paper
Jump Theorems for REA Operators1997-01-13Paper
On countable homogeneous \(3\)-hypergraphs1996-03-06Paper
Finite Homogeneous 3‐Graphs1996-01-28Paper
The continuity of cupping to \(\text \textbf{0}'\)1995-01-29Paper
Models of arithmetic and upper bounds for arithmetic sets1994-11-27Paper
The \(n\)-rea enumeration degrees are dense1993-09-01Paper
Obituary: Alan Mekler1993-06-29Paper
0-categorical tree-decomposable structures1993-04-01Paper
The d.r.e. degrees are not dense1992-06-28Paper
Complete Coinductive Theorems. II1992-06-27Paper
Some coinductive graphs1990-01-01Paper
Complete Coinductive Theories. I1990-01-01Paper
A Remark on Pseudo-Jump Operators1989-01-01Paper
Structures coordinatized by indiscernible sets1987-01-01Paper
A Note on Positive Equivalence Relations1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30322361987-01-01Paper
Alternative Characterizations of Precomplete Numerations1987-01-01Paper
Complete theories with only universal and existential axioms1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38138001987-01-01Paper
Binary Homogeneous Structures I1986-01-01Paper
Binary Homogeneous Structures II1986-01-01Paper
Stable Finitely Homogeneous Structures1986-01-01Paper
\(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures1985-01-01Paper
Vector spaces and binary quantifiers1984-01-01Paper
On countable stable structures which are homogeneous for a finite relational language1984-01-01Paper
Stable structures homogeneous for a finite binary language1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33439691984-01-01Paper
Two theorems on degrees of models of true arithmetic1984-01-01Paper
Countable Homogeneous Tournaments1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36668781982-01-01Paper
Construction of Satisfaction Classes for Nonstandard Models1981-01-01Paper
Full Satisfaction Classes and Recursive Saturation1981-01-01Paper
Not every finite lattice is embeddable in the recursively enumerable degrees1980-01-01Paper
Decomposition of Recursively Enumerable Degrees1980-01-01Paper
Countable Ultrahomogeneous Undirected Graphs1980-01-01Paper
Singular properties of Morley rank1980-01-01Paper
On the semantics of the Henkin quantifier1979-01-01Paper
Bounding minimal pairs1979-01-01Paper
Spectra of ω‐Stable Theories1978-01-01Paper
Skolem Functions and Elementary Extensions1978-01-01Paper
Possible Orderings of an Indiscernible Sequence1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138271976-01-01Paper
A recursively enumerable degree which will not split over all lesser ones1976-01-01Paper
Countable initial segments of the degrees of unsolvability1976-01-01Paper
Theories with a finite number of models in an uncountable power are categorical1975-01-01Paper
A note on Thomason's refined structures for tense logics1975-01-01Paper
A remark on the strict order property1975-01-01Paper
w tt-Complete Sets are not Necessarily tt-Complete1975-01-01Paper
Uniform enumeration operations1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38954531974-01-01Paper
Two conjectures regarding the stability of ω-categorical theories1974-01-01Paper
On universal Horn classes categorical in some infinite power1973-01-01Paper
Two theorems on many-one degrees of recursively enumerable sets1973-01-01Paper
Recursively enumerable many-one degrees1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44048661973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56706171972-01-01Paper
A property of stable theories1972-01-01Paper
The transcendental rank of a theory1971-01-01Paper
Solution to a Problem of Spector1971-01-01Paper
On strongly minimal sets1971-01-01Paper
On some games which are relevant to the theory of recursively enumerable sets1970-01-01Paper
Initial Segments of Many-One Degrees1970-01-01Paper
Computable Fields and Arithmetically Definable Ordered Fields1970-01-01Paper
Initial segments of one-one degrees1969-01-01Paper
The elementary theory of recursively enumerable sets1968-01-01Paper
On the Lattice of Recursively Enumerable Sets1968-01-01Paper
Complete Recursively Enumerable Sets1968-01-01Paper
Distributive Initial Segments of the Degrees of Unsolvability1968-01-01Paper
Degrees of recursively enumerable sets which have no maximal supersets1968-01-01Paper
The Priority Method I1967-01-01Paper
On Recursive Enumeration Without Repetition: A Correction1967-01-01Paper
On the indexing of classes of recursively enumerable sets1966-01-01Paper
Lower Bounds for Pairs of Recursively Enumerable Degrees1966-01-01Paper
The impossibility of finding relative complements for recursively enumerable degrees1966-01-01Paper
A note on universal sets1966-01-01Paper
On a Problem of G. E. Sacks1965-01-01Paper
Some Notions of Reducibility and Productiveness1965-01-01Paper
On Recursive Enumeration Without Repetition1965-01-01Paper
Effective Inseparability for Sequences of Sets1965-01-01Paper
STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS1964-01-01Paper
Recursive real numbers1964-01-01Paper
Effective operations in a general setting1964-01-01Paper
A note on the elementary α-perceptron1964-01-01Paper
Multiple Recursion1962-01-01Paper
The U‐Quantifier1961-01-01Paper

Research outcomes over time

This page was built for person: Alistair H. Lachlan