Comparing Sense and Denotation in Bilateralist Proof Systems for Proofs and Refutations
Abstract
In this paper a framework to distinguish in a Fregean manner between sense and denotation of \(\lambda\)-term-annotated derivations will be applied to a bilateralist sequent calculus displaying two derivability relations, one for proving and one for refuting. Therefore, a two-sorted typed \(\lambda\)-calculus will be used to annotate this calculus and a Dualization Theorem will be given, stating that for any derivable sequent expressing a proof, there is also a derivable sequent expressing a refutation and vice versa. By having joint \(\lambda\)-term annotations for proof systems in natural deduction and sequent calculus style, a comparison with respect to sense and denotation between derivations in those systems will be feasible, since the annotations elucidate the structural correspondences of the respective derivations. Thus, we will have a basis for determining in which cases, firstly, derivations expressing a proof vs. derivations expressing a refutation and, secondly, derivations in natural deduction vs. in sequent calculus can be identified and on which level.
Collections
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by-nc-nd/4.0
Related items
Showing items related by title, author, creator and subject.
-
Fractional-Valued Modal Logic and Soft Bilateralism
Piazza, Mario; Pulcini, Gabriele; Tesi, Matteo (Wydawnictwo Uniwersytetu Łódzkiego, 2023-08-16)In a recent paper, under the auspices of an unorthodox variety of bilateralism, we introduced a new kind of proof-theoretic semantics for the base modal logic \(\mathbf{K}\), whose values lie in the closed interval \([0,1]\) ... -
Elementary Proof of Strong Normalization for Atomic F
Ferreira, Fernando; Ferreira, Gilda (Wydawnictwo Uniwersytetu Łódzkiego, 2016)We give an elementary proof (in the sense that it is formalizable in Peano arithmetic) of the strong normalization of the atomic polymorphic calculus Fₐₜ (a predicative restriction of Girard’s system F). -
A post-style proof of completeness theorem for symmetric relatedness Logic S
Klonowski, Mateusz (Wydawnictwo Uniwersytetu Łódzkiego, 2018)One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a ...
