On the reducibility of decision problems
A. Janiczak (1954)
Colloquium 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 “Concerning definable sets”
On the reducibility of decision problems
Quantification of number-theoretic functions
S. C. Kleene (1959-1960)
Compositio Mathematica
Similarity:
Undecidable and creative theories
J. Shoenfield (1961)
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:
Deduction-preserving "Recursive Isomorphisms" between theories
Marian Pour-El, Saul Kripke (1967)
Fundamenta Mathematicae
Similarity:
Recursiveness of initial segments of Kleene's O
Carl Jockusch (1975)
Fundamenta Mathematicae
Similarity:
Recursion in total functionals of finite type
Solomon Feferman (1977)
Compositio Mathematica
Similarity:
Notation systems and recursive ordered fields
Yiannis N. Moschovakis (1965-1966)
Compositio Mathematica
Similarity: