The metatheory of the classical propositional calculus is not axiomatizable

DOI10.2307/2274233MaRDI QIDQ3748264zbMATH OpenOpenAlexFDO

Authors 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

Craig interpolationfirst-order theoryaxiomatizabilitycomplete theorypropositional calculushereditarily undecidabletwo-sorted structureinfinitary propositional calculi

Mathematics Subject Classification ID

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

Recommendations

• Undecidable problems for propositional calculi with implication
• Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication
• scientific article; zbMATH DE number 4114609
• scientific article; zbMATH DE number 107724
• Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi

Cites work

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

Cited in

(5)

• scientific article; zbMATH DE number 2063839 (Why is no real title available?)
• The variety of consequence, according to Bolzano
• Modal languages and bounded fragments of predicate logic
• The many faces of interpolation
• Modern faces of filtration

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748264)