A. H. Lachlan. A note on universal sets. The journal of symbolic logic, vol. 31 , pp. 573–574

Journal of Symbolic Logic 32 (3):395 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270796

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: A. H. Lachlan, A Note on Universal Sets. [REVIEW]P. R. Young - 1967 - Journal of Symbolic Logic 32 (3):395-395.
A Note on Universal Sets.A. H. Lachlan - 1967 - Journal of Symbolic Logic 32 (3):395-395.
A note on universal sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (4):573-574.
Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
Michael Morley. Countable models of ℵ1-categorical theories. Israel journal of mathematics, vol. 5 , pp. 65–72. - J. T. Baldwin and A. H. Lachlan. On strongly minimal sets. The journal of symbolic logic, vol. 36 ,pp. 79–96. [REVIEW]John W. Rosenthal - 1975 - Journal of Symbolic Logic 40 (4):636-637.
On strongly minimal sets.J. T. Baldwin & A. H. Lachlan - 1971 - Journal of Symbolic Logic 36 (1):79-96.
On the indexing of classes of recursively enumerable sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (1):10-22.
Simplicity of Recursively Enumerable Sets.Two Theorems on hyperhypersimple Sets.On the Lattice of Recursively Enumerable Sets.The Elementary Theory of Recursively Enumerable Sets.Robert W. Robinson & A. H. Lachlan - 1970 - Journal of Symbolic Logic 35 (1):153-155.
On Some Games which are Relevant to the Theory of Recursively Enumerable Sets.A. H. Lachlan - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Degrees of recursively enumerable sets which have no maximal supersets.A. H. Lachlan - 1968 - Journal of Symbolic Logic 33 (3):431-443.
Review: A. H. Lachlan, On Some Games which are Relevant to the Theory of Recursively Enumerable Sets. [REVIEW]Gregory W. Jones - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Review: A. A. Mucnik, E. Mendelson, Isomorphism of Systems of Recursively Enumerable Sets with Effective Properties. [REVIEW]A. H. Lachlan - 1967 - Journal of Symbolic Logic 32 (3):393-394.
Lachlan A. H.. On some games which are relevant to the theory of recursively enumerable sets. Annals of mathematics, ser. 2 vol. 91 , pp. 291–310. [REVIEW]Gregory W. Jones - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Review: Michael Morley, Countable Models of $aleph_1$-Categorical Theories; J. T. Baldwin, A. H. Lachlan, On Strongly Minimal Sets. [REVIEW]John W. Rosenthal - 1975 - Journal of Symbolic Logic 40 (4):636-637.
A Note on Thomason's Refined Structures for Tense Logics.Robert A. Bull - 1982 - Journal of Symbolic Logic 47 (2):440-445.

Analytics

Added to PP
2016-06-30

Downloads
34 (#459,882)

6 months
3 (#1,002,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references