Functional interpretation of bar induction by bar recursion
W. A. Howard (1968)
Compositio Mathematica
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.
Displaying similar documents to “A model for barrecursion of higher types”
Functional interpretation of bar induction by bar recursion
On the definition of computable functionals
Andrzej Grzegorczyk (1955)
Fundamenta Mathematicae
Similarity:
On the concepts of completeness and interpretation of formal systems
G. Kreisel (1952)
Fundamenta Mathematicae
Similarity:
Arithmetization of metamathematics in a general setting
S. Feferman (1960)
Fundamenta Mathematicae
Similarity:
Note on arithmetic models for consistent formulae of the predicate calculus
G. Kreisel (1950)
Fundamenta Mathematicae
Similarity:
A generalization of the incompleteness theorem
Andrzej Mostowski (1961)
Fundamenta Mathematicae
Similarity:
A formula with no recursively enumerable model
Andrzej Mostowski (1955)
Fundamenta Mathematicae
Similarity:
Consistency statements in formal theories
R. Jeroslow (1971)
Fundamenta Mathematicae
Similarity:
Non-extensional equality
A. Troelstra (1975)
Fundamenta Mathematicae
Similarity:
An unfinitizability proof by means of restricted reduced power
Andrzej Grzegorczyk (1971)
Fundamenta Mathematicae
Similarity: