| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4663004 | Journal of Applied Logic | 2013 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Michael Tiomkin,