A Connection-Based Characterization of Bi-intuitionistic Validity
Identifieur interne : 002793 ( Main/Exploration ); précédent : 002792; suivant : 002794A Connection-Based Characterization of Bi-intuitionistic Validity
Auteurs : Didier Galmiche [France] ; Daniel Méry [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: 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-graph from which we then obtain a connection-based characterization of propositional bi-intuitionistic validity and derive a sound and complete free-variable labelled sequent calculus that admits cut-elimination and also variable splitting.
Url:
DOI: 10.1007/978-3-642-22438-6_21
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003470
- to stream Istex, to step Curation: 003428
- to stream Istex, to step Checkpoint: 000693
- to stream Main, to step Merge: 002835
- to stream Main, to step Curation: 002793
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Connection-Based Characterization of Bi-intuitionistic Validity</title><author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name></author><author><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DD097B702A0408605CDBB703C1D4A67BE3D7502D</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-22438-6_21</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-L5M2G107-2/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003470</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003470</idno><idno type="wicri:Area/Istex/Curation">003428</idno><idno type="wicri:Area/Istex/Checkpoint">000693</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000693</idno><idno type="wicri:doubleKey">0302-9743:2011:Galmiche D:a:connection:based</idno><idno type="wicri:Area/Main/Merge">002835</idno><idno type="wicri:Area/Main/Curation">002793</idno><idno type="wicri:Area/Main/Exploration">002793</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Connection-Based Characterization of Bi-intuitionistic Validity</title><author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA - Université Henri Poincaré, Campus Scientifique, BP 239, Vandœuvre-lés-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName><orgName type="university">Université Henri Poincaré</orgName></affiliation></author><author><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA - Université Henri Poincaré, Campus Scientifique, BP 239, Vandœuvre-lés-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName><orgName type="university">Université Henri Poincaré</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: 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-graph from which we then obtain a connection-based characterization of propositional bi-intuitionistic validity and derive a sound and complete free-variable labelled sequent calculus that admits cut-elimination and also variable splitting.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li><li>Vandœuvre-lès-Nancy</li></settlement><orgName><li>Université Henri Poincaré</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name></region><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002793 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002793 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:DD097B702A0408605CDBB703C1D4A67BE3D7502D
|texte= A Connection-Based Characterization of Bi-intuitionistic Validity
}}
| This area was generated with Dilib version V0.6.33. |  |