On a system of axioms which has no recursively enumerable arithmetic model
Andrzej Mostowski (1953)
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 “A formula with no recursively enumerable model”
On a system of axioms which has no recursively enumerable arithmetic model
Undecidable and creative theories
J. Shoenfield (1961)
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:
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:
Non-extensional equality
A. Troelstra (1975)
Fundamenta Mathematicae
Similarity:
On the decision problem for extensions of a decidable theory
Verena Huber Dyson (1969)
Fundamenta Mathematicae
Similarity:
A kind of categoricity
Andrzej Grzegorczyk (1962)
Colloquium Mathematicae
Similarity:
The quantifier complexity of NF.
Kaye, Richard (1996)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity: