Vaught's Theorem on Axiomatizability by a Scheme

DOI10.2178/BSL/1344861888zbMath1272.03063OpenAlexW2122736112MaRDI QIDQ2915888

Albert Visser

Publication date: 19 September 2012

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bsl/1344861888

zbMATH Keywords

predicate logicaxiomatizability by a schemepair theoryunordered pairingVaught theoryVaught's theorem

Mathematics Subject Classification ID

Classical first-order logic (03B10) Foundations of classical theories (including reverse mathematics) (03B30) Relative consistency and interpretations (03F25)

Related Items (5)

Friedman-reflexivity ⋮ There are no minimal effectively inseparable theories ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW ⋮ On \(\mathsf{Q}\) ⋮ Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories

Cites Work

• Unnamed Item
• Pairs, sets and sequences in first-order theories
• On the scheme of induction for bounded arithmetic formulas
• The computational complexity of logical theories
• The predicative Frege hierarchy
• Can We Make the Second Incompleteness Theorem Coordinate Free?
• Finite Axiomatizability using additional predicates
• Schemata: The Concept of Schema in the History of Logic
• A lattice of chapters of mathematics (interpretations between theorems [theories)]
• THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS
• On axiomatizability within a system
• Decidability of the theory of the natural integers with the Cantor pairing function and the successor

This page was built for publication: Vaught's Theorem on Axiomatizability by a Scheme