From strategies to derivations and back An easy completeness proof for first order intuitionistic dialogical logic - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

From strategies to derivations and back An easy completeness proof for first order intuitionistic dialogical logic

Résumé

In this paper we give a new proof of the correspondence between the existence of a winning strategies for intuitionistic E-games and Intuistionistic validity for first order logic. The proof is obtained by a direct mapping between formal E-strategy and derivations in a cut-free complete sequent calculus for first order intuitionistic logic. Our approach builds on the one developed by Herbelin in his PhD dissertation and greatly simplifies the proof of correspondence given by Felscher in his classic paper
Fichier principal
Vignette du fichier
Completeness_proof_dialogical_logic_CATTA.pdf (182.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03188862 , version 1 (02-04-2021)
hal-03188862 , version 2 (07-06-2021)
hal-03188862 , version 3 (06-07-2021)
hal-03188862 , version 4 (06-03-2022)
hal-03188862 , version 5 (12-07-2022)

Identifiants

  • HAL Id : hal-03188862 , version 4

Citer

Davide Catta. From strategies to derivations and back An easy completeness proof for first order intuitionistic dialogical logic. 2022. ⟨hal-03188862v4⟩
109 Consultations
93 Téléchargements

Partager

Gmail Facebook X LinkedIn More