|
|||||
|
|
A sequent calculus for a logic of contingencies |
|
| Authors: | Michael Tiomkin |
| Institution: | ColumbiaUniversity |
| 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: | Contingency Propositional contingent formulas Sequent calculus Soundness and completeness |
| 本文献已被 ScienceDirect 等数据库收录！ | |