On recursively enumerable and arithmetic models of set theory

Journal of Symbolic Logic 23 (4):408-416 (1958)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964015

Other Versions

reprint Rabin, Michael O. (1963) "On Recursively Enumerable and Arithmetic Models of Set Theory". Journal of Symbolic Logic 28(2):167-168

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,951

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: Michael O. Rabin, On Recursively Enumerable and Arithmetic Models of Set Theory. [REVIEW]J. C. Shepherdson - 1963 - Journal of Symbolic Logic 28 (2):167-168.
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.
Σ2 -collection and the infinite injury priority method.Michael E. Mytilinaios & Theodore A. Slaman - 1988 - Journal of Symbolic Logic 53 (1):212-221.
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.
Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.Robert A. Di Paola & Franco Montagna - 1991 - Journal of Symbolic Logic 56 (2):643-660.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
The Sacks density theorem and Σ2-bounding.Marcia Groszek, Michael Mytilinaios & Theodore Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.

Analytics

Added to PP
2009-01-28

Downloads
96 (#236,296)

6 months
27 (#128,807)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.
XV—On Consistency and Existence in Mathematics.Walter Dean - 2021 - Proceedings of the Aristotelian Society 120 (3):349-393.
Bernays and the Completeness Theorem.Walter Dean - 2017 - Annals of the Japan Association for Philosophy of Science 25:45-55.
The Boolean algebra of formulas of first-order logic.Don H. Faust - 1982 - Annals of Mathematical Logic 23 (1):27.

Add more citations

References found in this work

Add more references