Criterion for propositional calculi to be finitely generated

DOI10.1515/DMA-2013-0028MaRDI QIDQ2344087zbMATH OpenOpenAlexFDO

Authors G. V. Bokov

Publication date 12 May 2015

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2013-0028

zbMATH Keywords

basisfinite complete systemsinference rulespropositional calculus

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Recommendations

• On finite-valued propositional logical calculi
• Completeness of the generalized propositional calculus
• The classification of propositional calculi
• Some structure results for propositional calculi
• Finite Kripke models and predicate logics of provability
• A GENERALIZATION OF LINDENBAUM'S THEOREM FOR PREDICATE CALCULI
• A sufficient condition for finite decidability
• Proof theory for finitely valid sentences
• Jauch-Piron logics with finiteness conditions

Cited in

(1)

• scientific article; zbMATH DE number 169734 (Why is no real title available?)

This page was built for publication: Criterion for propositional calculi to be finitely generated

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