Measures of centrality and complexity for partial propositional calculi

DOI10.1007/BF02019771zbMath0248.02018MaRDI QIDQ5661842

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

• Unnamed Item
• Gentzen-like systems for partial propositional calculi. I. II
• The strong decidability of cut-logics. I: Partial propositional calculi
• The strong decidability of cut logics. II. Generalizations
• On the Axioms of Information Theory

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