A Connection-based Characterization of Bi-intuitionistic Validity - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2013

A Connection-based Characterization of Bi-intuitionistic Validity

Didier Galmiche
Daniel Mery

Résumé

We give a connection-based characterization of validity in propositional bi-intuitionistic logic in terms of specific directed graphs called R-graphs. Such a characterization is well-suited for deriving labelled proof-systems with counter-model construction facilities. We first define the notion of bi-intuitionistic R-graphs from which we then obtain a connection-based characterization of propositional bi-intuitionistic validity and derive a sound and complete cut-free free-variable labelled sequent calculus that enjoys variable splitting.

Dates et versions

hal-01258963 , version 1 (19-01-2016)

Identifiants

Citer

Didier Galmiche, Daniel Mery. A Connection-based Characterization of Bi-intuitionistic Validity. Journal of Automated Reasoning, 2013, 51 (1), pp.3--26. ⟨10.1007/s10817-013-9279-4⟩. ⟨hal-01258963⟩
121 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More