On recursively enumerable and arithmetic models of set theory

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

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2964015
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 41,507
Through your library

References found in this work BETA

Introduction to Metamathematics.Stephen Cole Kleene - 1954 - Journal of Symbolic Logic 19 (3):215-216.

Add more references

Citations of this work BETA

The Boolean Algebra of Formulas of First-Order Logic.Don H. Faust - 1982 - Annals of Pure and Applied Logic 23 (1):27.
Bernays and the Completeness Theorem.Walter Dean - 2017 - Annals of the Japan Association for Philosophy of Science 25:45-55.

Add more citations

Similar books and articles

Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
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.

Analytics

Added to PP index
2009-01-28

Total views
28 ( #294,611 of 2,248,752 )

Recent downloads (6 months)
17 ( #47,398 of 2,248,752 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature