Note on arithmetic models for consistent formulae of the predicate calculus
G. Kreisel (1950)
Fundamenta 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.
Displaying similar documents to “On the concepts of completeness and interpretation of formal systems”
Note on arithmetic models for consistent formulae of the predicate calculus
Arithmetization of metamathematics in a general setting
S. Feferman (1960)
Fundamenta Mathematicae
Similarity:
On definable sets of positive integers
Andrzej Mostowski (1947)
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:
Failure of completeness properties of intuitionistic predicate logic for constructive models
Daniel Leivant (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
A kind of categoricity
Andrzej Grzegorczyk (1962)
Colloquium Mathematicae
Similarity:
Some applications of formalized consistency proofs
G. Kreisel, Hao Wang (1955)
Fundamenta Mathematicae
Similarity:
Undecidable and creative theories
J. Shoenfield (1961)
Fundamenta Mathematicae
Similarity: