On a system of axioms which has no recursively enumerable arithmetic model
Andrzej Mostowski (1953)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “An application of a reflection principle”
On a system of axioms which has no recursively enumerable arithmetic model
Applications of formalized consistency proofs II
G. Kreisel, Hao Wang (1958)
Fundamenta Mathematicae
Similarity:
Indicators, recursive saturation and expandability
L. Kirby, K. McAllon, R. Murawski (1981)
Fundamenta Mathematicae
Similarity:
On Sigma10-extensions of Omega
Žarko Mijajlović (1983)
Publications de l'Institut Mathématique
Similarity:
Undecidable and creative theories
J. Shoenfield (1961)
Fundamenta Mathematicae
Similarity:
End-extending models of
Zofia Adamowicz (1990)
Fundamenta Mathematicae
Similarity:
On interpretability in theories containing arithmetic
Marie Hájková, Petr Hájek (1972)
Fundamenta Mathematicae
Similarity:
Some problem in elementary arithmetics
D. Jensen, A. Ehrenfeucht (1976)
Fundamenta Mathematicae
Similarity:
On elementary cuts in models of arithmetic
Henryk Kotlarski (1983)
Fundamenta Mathematicae
Similarity:
Note on arithmetic models for consistent formulae of the predicate calculus
G. Kreisel (1950)
Fundamenta Mathematicae
Similarity:
A kind of categoricity
Andrzej Grzegorczyk (1962)
Colloquium Mathematicae
Similarity: