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 [Book Review]

Journal of Symbolic Logic 39 (2):345-345 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272685

Links

PhilArchive



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

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, 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.
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.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
The continuity of cupping to 0'.Klaus Ambos-Spies, Alistair H. Lachlan & Robert I. Soare - 1993 - Annals of Pure and Applied Logic 64 (3):195-209.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Decision problem for separated distributive lattices.Yuri Gurevich - 1983 - Journal of Symbolic Logic 48 (1):193-196.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On the indexing of classes of recursively enumerable sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (1):10-22.
On injective enumerability of recursively enumerable classes of cofinite sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
Degrees of recursively enumerable sets which have no maximal supersets.A. H. Lachlan - 1968 - Journal of Symbolic Logic 33 (3):431-443.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.

Analytics

Added to PP
2016-06-30

Downloads
9 (#1,249,590)

6 months
3 (#965,065)

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