A construction for consistent systems
I. Novak (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.
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 “The quantifier complexity of NF.”
A construction for consistent systems
A kind of categoricity
Andrzej Grzegorczyk (1962)
Colloquium Mathematicae
Similarity:
Relativization with respect to formulas and its use in proofs of independence
Leon Henkin (1968)
Compositio Mathematica
Similarity:
Non-finitizability of a weak second-order theory
Wolfram Schwabhäuser (1979)
Fundamenta Mathematicae
Similarity:
Arithmetization of metamathematics in a general setting
S. Feferman (1960)
Fundamenta Mathematicae
Similarity:
On the concepts of completeness and interpretation of formal systems
G. Kreisel (1952)
Fundamenta Mathematicae
Similarity:
Note on arithmetic models for consistent formulae of the predicate calculus
G. Kreisel (1950)
Fundamenta Mathematicae
Similarity:
On ω-models which are not β-models
Andrzej Mostowski, Y. Suzuki (1969)
Fundamenta Mathematicae
Similarity:
Models of axiomatic systems
Andrzej Mostowski (1952)
Fundamenta Mathematicae
Similarity:
Kripke models for intuitionistic theories with decidable atomic formulas.
Marković, Zoran (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Generalizing Vaught sentences from ω to strong cofinality ω
M. Makkai (1974)
Fundamenta Mathematicae
Similarity: