Computable functionals
Andrzej Grzegorczyk (1955)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “On the definition of computable functionals”
Computable functionals
Functional interpretation of bar induction by bar recursion
W. A. Howard (1968)
Compositio Mathematica
Similarity:
A model for barrecursion of higher types
B. Scarpellini (1971)
Compositio Mathematica
Similarity:
On the definitions of computable real continuous functions
Andrzej Grzegorczyk (1957)
Fundamenta Mathematicae
Similarity:
A system which can define its own truth
John Myhill (1950)
Fundamenta Mathematicae
Similarity:
On the concepts of completeness and interpretation of formal systems
G. Kreisel (1952)
Fundamenta Mathematicae
Similarity:
On definable sets of positive integers
Andrzej Mostowski (1947)
Fundamenta Mathematicae
Similarity:
Recursion in total functionals of finite type
Solomon Feferman (1977)
Compositio Mathematica
Similarity:
Arithmetization of metamathematics in a general setting
S. Feferman (1960)
Fundamenta Mathematicae
Similarity:
Algebraic Treatment of the Functional Calculi of Heyting and Lewis
H. Rasiowa (1951)
Fundamenta Mathematicae
Similarity: