A sequent calculus for a logic of contingencies

We introduce a sequent calculus that is sound and complete with respect to propositional contingencies, i.e., formulas which are neither provable nor refutable. Like many other sequent and natural deduction proof systems, this calculus possesses cut elimination and the subformula property and has a...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied logic 2013-12, Vol.11 (4), p.530-535
Main Author: Tiomkin, Michael
Format: Article
Language:English
Subjects:
Calculus
Contingency
Deduction
Logic
Mathematical analysis
Propositional contingent formulas
Proving
Searching
Sequent calculus
Sound
Soundness and completeness
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a sequent calculus that is sound and complete with respect to propositional contingencies, i.e., formulas which are neither provable nor refutable. Like many other sequent and natural deduction proof systems, this calculus possesses cut elimination and the subformula property and has a simple proof search mechanism.
ISSN:1570-8683
1570-8691
DOI:10.1016/j.jal.2013.05.001