Alan Cobham. Some remarks concerning theories with recursively enumerable complements. The journal of symbolic logic, vol. 28 no. 1 , pp. 72–74 [Book Review]

Journal of Symbolic Logic 30 (2):255-255 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270168

Links

PhilArchive



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

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

Some remarks concerning theories with recursively enumerable complements.Alan Cobham - 1963 - Journal of Symbolic Logic 28 (1):72-74.
Some Remarks Concerning Theories with Recursively Enumerable Complements.Alan Cobham - 1965 - Journal of Symbolic Logic 30 (2):255-255.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
A. H. Lachlan. The impossibility of finding relative complements for recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 434–454. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
The Impossibility of Finding Relative Complements for Recursively Enumerable Degrees.A. H. Lachlan - 1971 - Journal of Symbolic Logic 36 (3):539-540.
The impossibility of finding relative complements for recursively enumerable degrees.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (3):434-454.
Robert A. DiPaola. Pseudo-complements and ordinal logics based on consistency statements. The journal of symbolic logic, vol. 31 , pp. 359–364. - Robert A. Dipaola. Some properties of pseudo-complements of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 121 , pp. 296–308. [REVIEW]J. R. Shoenfield - 1972 - Journal of Symbolic Logic 37 (2):406-406.
Review: A. H. Lachlan, The Impossibility of Finding Relative Complements for Recursively Enumerable Degrees. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Some Remarks on Extensibility, Confluence of Paths, Branching Properties, and Index Sets, for Certain Recursively Enumerable Graphs.T. G. Mclaughlin - 1969 - Journal of Symbolic Logic 34 (3):518-518.
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.
Mostowski A.. On a system of axioms which has no recursively enumerable arithmetic model. Fundamenta mathematicae, Bd. 40 , S. 56–61.Mostowski A.. A formula with no recursively enumerable model. Ebd., Bd. 42 , S. 125–140. [REVIEW]G. Hasenjaeger - 1958 - Journal of Symbolic Logic 23 (1):45-45.

Analytics

Added to PP
2013-11-22

Downloads
9 (#1,187,161)

6 months
4 (#698,851)

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