Problems and Consequences of Bilateral Notions of (Meta-)Derivability
By: Sara Ayhan
Potential Business Impact:
Makes computer logic show proof and disproof.
A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a system with two derivability relations is obtained, which can be quite naturally expressed in a proof system of natural deduction but which faces obstacles in a sequent calculus representation. Since in a sequent calculus there are two derivability relations inherent, one expressed by the sequent sign and one by the horizontal lines holding between sequents, in a truly bilateral calculus both need to be dualized. While dualizing the sequent sign is rather straightforwardly corresponding to dualizing the horizontal lines in natural deduction, dualizing the horizontal lines in sequent calculus, uncovers problems that, as will be argued in this paper, shed light on deeper conceptual issues concerning an imbalance between the notions of proof vs. refutation. The roots of this problem will be further analyzed and possible solutions on how to retain a bilaterally desired balance in our system are presented.
Similar Papers
Bilateralist base-extension semantics with incompatible proofs and refutations
Logic in Computer Science
Keeps math proofs from being wrong.
Bilateral base-extension semantics
Logic
Makes logic understand "yes" and "no" separately.
Classical notions of computation and the Hasegawa-Thielecke theorem (extended version)
Logic in Computer Science
Makes computer logic work with different thinking styles.