Deduction-preserving "Recursive Isomorphisms" between theories
Marian Pour-El, Saul Kripke (1967)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Examples of sets definable by means of two and three quantifiers”
Deduction-preserving "Recursive Isomorphisms" between theories
Extension of an effectively generated class of functions by enumeration
S. Kleene (1958)
Colloquium Mathematicae
Similarity:
General recursive functionals of finite type and hierarchies of functions
R. O. Gandy (1967)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Comparisons between some generalizations of recursion theory
Carl E. Gordon (1970)
Compositio Mathematica
Similarity:
On primitive recursive real numbers
R. Lehman (1961)
Fundamenta Mathematicae
Similarity:
Recursive objects in all finite types
Andrzej Grzegorczyk (1964)
Fundamenta Mathematicae
Similarity:
A generalization of the incompleteness theorem
Andrzej Mostowski (1961)
Fundamenta Mathematicae
Similarity:
Good choice sets
J. C. E. Dekker (1966)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity: