Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations

07/03/2023
by   Sara Ayhan, et al.
0

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction system of Wansing's bi-intuitionistic logic 2Int (2016a; 2017), which I will turn into a term-annotated form. Therefore, we need a type theory that extends to a two-sorted typed lambda-calculus. I will present such a term-annotated proof system for 2Int and prove some properties and results for it, most importantly for this paper a Dualization Theorem relating proofs and refutations in this system. On the basis of these formal results I will argue that this gives us interesting insights into questions about sense and denotation as well as synonymy and identity of proofs from a bilateralist point of view.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2020

A cut-free sequent calculus for the bi-intuitionistic logic 2Int

The purpose of this paper is to introduce a bi-intuitionistic sequent ca...
research
06/03/2020

Curry-Howard-Lambek Correspondence for Intuitionistic Belief

This paper introduces a natural deduction calculus for intuitionistic lo...
research
01/21/2013

Computational Aspects of the Calculus of Structure

Logic is the science of correct inferences and a logical system is a too...
research
04/27/2018

A theory of linear typings as flows on 3-valent graphs

Building on recently established enumerative connections between lambda ...
research
01/07/2021

Theorem Proving and Algebra

This book can be seen either as a text on theorem proving that uses tech...
research
04/04/2023

Introduction to Pylog

PyLog is a minimal experimental proof assistant based on linearised natu...
research
04/27/2021

Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report)

Logic-based approaches to AI have the advantage that their behavior can ...

Please sign up or login with your details

Forgot password? Click here to reset