A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function

James Schmerl

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “A decidable $ℵ_{0}$ -categorical theory with a non-recursive Ryll-Nardzewski function”

Undecidable and creative theories

J. Shoenfield (1961)

Fundamenta Mathematicae

Similarity:

Deduction-preserving "Recursive Isomorphisms" between theories

Marian Pour-El, Saul Kripke (1967)

Fundamenta 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:

Quantification of number-theoretic functions

S. C. Kleene (1959-1960)

Compositio Mathematica

Similarity:

Good choice sets

J. C. E. Dekker (1966)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

Arithmetical classification of the set of all provably recursive functions

Vítězslav Švejdar (1999)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The set of all indices of all functions provably recursive in any reasonable theory $T$ is shown to be recursively isomorphic to $U \times \bar{U}$ , where $U$ is $Π_{2}$ -complete set.

Displaying similar documents to “A decidable ℵ 0 -categorical theory with a non-recursive Ryll-Nardzewski function”

Undecidable and creative theories

Deduction-preserving "Recursive Isomorphisms" between theories

General recursive functionals of finite type and hierarchies of functions

Quantification of number-theoretic functions

Good choice sets

Arithmetical classification of the set of all provably recursive functions

Displaying similar documents to “A decidable $ℵ_{0}$ -categorical theory with a non-recursive Ryll-Nardzewski function”