Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 48, Number 4 (2007), 521-530.
A Sound and Complete Proof Theory for Propositional Logical Contingencies
There are simple, purely syntactic axiomatic proof systems for both the logical truths and the logical falsehoods of propositional logic. However, to date no such system has been developed for the logical contingencies, that is, formulas that are both satisfiable and falsifiable. This paper formalizes the purely syntactic axiomatic proof systems for the logical contingencies and proves its soundness as well as completeness.
Notre Dame J. Formal Logic, Volume 48, Number 4 (2007), 521-530.
First available in Project Euclid: 29 October 2007
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03B05: Classical propositional logic
Morgan, Charles; Hertel, Alexander; Hertel, Philipp. A Sound and Complete Proof Theory for Propositional Logical Contingencies. Notre Dame J. Formal Logic 48 (2007), no. 4, 521--530. doi:10.1305/ndjfl/1193667709. https://projecteuclid.org/euclid.ndjfl/1193667709