Arithmetization of metamathematics in a general setting
S. Feferman (1960)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “Choice sequences and Markov's principle”
Arithmetization of metamathematics in a general setting
A generalization of the incompleteness theorem
Andrzej Mostowski (1961)
Fundamenta Mathematicae
Similarity:
Failure of completeness properties of intuitionistic predicate logic for constructive models
Daniel Leivant (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Recursion in total functionals of finite type
Solomon Feferman (1977)
Compositio Mathematica
Similarity:
An unfinitizability proof by means of restricted reduced power
Andrzej Grzegorczyk (1971)
Fundamenta Mathematicae
Similarity:
Deduction-preserving "Recursive Isomorphisms" between theories
Marian Pour-El, Saul Kripke (1967)
Fundamenta Mathematicae
Similarity:
Comparisons between some generalizations of recursion theory
Carl E. Gordon (1970)
Compositio Mathematica
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: