Notre Dame Journal of Formal Logic 48 (4):521-530 (2007)
|Abstract||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|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Allard Tamminga (1994). Logics of Rejection: Two Systems of Natural Deduction. Logique Et Analyse 146:169-208.
Andrzej Wiśniewski (2004). Socratic Proofs. Journal of Philosophical Logic 33 (3):299-326.
Fabrice Correia (2000). Propositional Logic of Essence. Journal of Philosophical Logic 29 (3):295-313.
Nathan Segerlind (2007). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 13 (4):417-481.
Stéphane Demri (1997). A Completeness Proof for a Logic with an Alternative Necessity Operator. Studia Logica 58 (1):99-112.
Pavel Naumov (2005). On Modal Logics of Partial Recursive Functions. Studia Logica 81 (3):295 - 309.
Jan Krajíček (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press.
David Ripley (2012). Conservatively Extending Classical Logic with Transparent Truth. The Review of Symbolic Logic 5 (2):354-378.
Patrizio Contu (2006). The Justification of the Logical Laws Revisited. Synthese 148 (3):573 - 588.
Robert Goldblatt & Michael Kane (2010). An Admissible Semantics for Propositionally Quantified Relevant Logics. Journal of Philosophical Logic 39 (1):73 - 100.
Sorry, there are not enough data points to plot this chart.
Added to index2010-08-24
Total downloads1 ( #291,386 of 722,786 )
Recent downloads (6 months)0
How can I increase my downloads?