The metatheory of the classical propositional calculus is not axiomatizable

DOI10.2307/2274233zbMath0608.03002OpenAlexW1994261599MaRDI QIDQ3748264

Ian A. Mason

Publication date: 1985

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

Full work available at URL: https://doi.org/10.2307/2274233

zbMATH Keywords

first-order theoryCraig interpolationaxiomatizabilitypropositional calculuscomplete theoryhereditarily undecidabletwo-sorted structureinfinitary propositional calculi

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Classical propositional logic (03B05) Classification theory, stability, and related concepts in model theory (03C45) Interpolation, preservation, definability (03C40) Abstract model theory (03C95)

Related Items (3)

The variety of consequence, according to Bolzano ⋮ Modal languages and bounded fragments of predicate logic ⋮ The many faces of interpolation

Cites Work

• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• An algebraic result about soft model theoretical equivalence relations with an application to H. Friedman's fourth problem
• δ-Logics and generalized quantifiers

This page was built for publication: The metatheory of the classical propositional calculus is not axiomatizable