A Sound and Complete Proof Theory for Propositional Logical Contingencies
Morgan, Charles ; Hertel, Alexander ; Hertel, Philipp
Notre Dame J. Formal Logic, Tome 48 (2007) no. 1, p. 521-530 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2007-10-14
Classification:  logical contingencies,  logically contingent formulas,  classical propositional logic,  purely syntactic proof systems,  03B05 
@article{1193667709,
     author = {Morgan, Charles and Hertel, Alexander and Hertel, Philipp},
     title = {A Sound and Complete Proof Theory for Propositional Logical Contingencies},
     journal = {Notre Dame J. Formal Logic},
     volume = {48},
     number = {1},
     year = {2007},
     pages = { 521-530},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1193667709}
}

Morgan, Charles; Hertel, Alexander; Hertel, Philipp. A Sound and Complete Proof Theory for Propositional Logical Contingencies. Notre Dame J. Formal Logic, Tome 48 (2007) no. 1, pp.  521-530. http://gdmltest.u-ga.fr/item/1193667709/