A characterization of expandability of models for ZF to models for KM
Zygmunt Ratajczyk (1981)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “Indicators, recursive saturation and expandability”
A characterization of expandability of models for ZF to models for KM
On elementary cuts in recursively saturated models of Peano Arithmetic
Henryk Kotlarski (1984)
Fundamenta Mathematicae
Similarity:
An application of a reflection principle
Zofia Adamowicz, Leszek Aleksander Kołodziejczyk, Paweł Zbierski (2003)
Fundamenta Mathematicae
Similarity:
We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.
[unknown]
Roman Kossak (1984)
Fundamenta Mathematicae
Similarity:
On elementary cuts in models of arithmetic
Henryk Kotlarski (1983)
Fundamenta Mathematicae
Similarity:
Some problem in elementary arithmetics
D. Jensen, A. Ehrenfeucht (1976)
Fundamenta Mathematicae
Similarity:
Applications of formalized consistency proofs II
G. Kreisel, Hao Wang (1958)
Fundamenta Mathematicae
Similarity:
On a system of axioms which has no recursively enumerable arithmetic model
Andrzej Mostowski (1953)
Fundamenta Mathematicae
Similarity:
Generalizing Vaught sentences from ω to strong cofinality ω
M. Makkai (1974)
Fundamenta Mathematicae
Similarity:
On Sigma10-extensions of Omega
Žarko Mijajlović (1983)
Publications de l'Institut Mathématique
Similarity:
On interpretability in theories containing arithmetic
Marie Hájková, Petr Hájek (1972)
Fundamenta Mathematicae
Similarity: