Comparing Sense and Denotation in Bilateralist Proof Systems for Proofs and Refutations

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.

Authors

Institutions

Publication Details

Journal
Bulletin of the Section of Logic
Published
2025-05-30
DOI
https://doi.org/10.18778/0138-0680.2025.03
Citations
1
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparing Sense and Denotation in Bilateralist Proof Systems for Proofs and Refutations

Sara Ayhan
1 citations
Bulletin of the Section of Logic
Logic, programming, and type systems
article

Comparing Sense and Denotation in Bilateralist Proof Systems for Proofs and Refutations

Sara Ayhan
article en
1 citations

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.

Bulletin of the Section of LogicVol. 54(1)
Ruhr University Bochum (DE)
Openalex Percentile: Top 94%
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.