Measures of centrality and complexity for partial propositional calculi

DOI10.1007/BF02019771MaRDI QIDQ5661842zbMATH OpenFDO

Authors E. William jun. Chapin

Publication date 1972

Published in Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137861

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Cites work

• Gentzen-like systems for partial propositional calculi. I. II
• scientific article; zbMATH DE number 3228255 (Why is no real title available?)
• On the Axioms of Information Theory
• The strong decidability of cut logics. II. Generalizations
• The strong decidability of cut-logics. I: Partial propositional calculi

This page was built for publication: Measures of centrality and complexity for partial propositional calculi

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