A Sound and Complete Proof Theory for Propositional Logical Contingencies

Notre Dame Journal of Formal Logic 48 (4):521-530 (2007)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A simple propositional S5 tableau system.Melvin Fitting - 1999 - Annals of Pure and Applied Logic 96 (1-3):107-115.
Complementary Logics for Classical Propositional Languages.Achille C. Varzi - 1992 - Kriterion - Journal of Philosophy 4 (1):20-24.
Socratic proofs.Andrzej Wiśniewski - 2004 - Journal of Philosophical Logic 33 (3):299-326.
Propositional logic of essence.Fabrice Correia - 2000 - Journal of Philosophical Logic 29 (3):295-313.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.

Analytics

Added to PP
2010-08-24

Downloads
29 (#472,224)

6 months
1 (#1,028,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A sequent calculus for a logic of contingencies.Michael Tiomkin - 2013 - Journal of Applied Logic 11 (4):530-535.

Add more citations