Subformula Linking for Intuitionistic Logic with Application to Type Theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Subformula Linking for Intuitionistic Logic with Application to Type Theory

Abstract

Abstract Subformula linking is an interactive theorem proving technique that was initially proposed for (classical) linear logic. It is based on truth and context preserving rewrites of a conjecture that are triggered by a user indicating links between subformulas, which can be done by direct manipulation, without the need of tactics or proof languages. The system guarantees that a true conjecture can always be rewritten to a known, usually trivial, theorem. In this work, we extend subformula linking to intuitionistic first-order logic with simply typed lambda-terms as the term language of this logic. We then use a well known embedding of intuitionistic type theory into this logic to demonstrate one way to extend linking to type theory.
Fichier principal
Vignette du fichier
paper39_hal.pdf (386.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03528659 , version 1 (18-01-2022)

Identifiers

Cite

Kaustuv Chaudhuri. Subformula Linking for Intuitionistic Logic with Application to Type Theory. CADE 2021 - 28th International Conference on Automated Deduction, Jul 2021, Pittsburgh, PA (Virtual), United States. pp.200-216, ⟨10.1007/978-3-030-79876-5_12⟩. ⟨hal-03528659⟩
40 View
63 Download

Altmetric

Share

Gmail Facebook X LinkedIn More