On Combinatorial Proofs for Logics of Relevance and Entailment

Matteo Acclavio; Lutz Straßburger

doi:10.1007/978-3-662-59533-6_1

On Combinatorial Proofs for Logics of Relevance and Entailment

Matteo Acclavio
, Lutz Straßburger

University Roma Tre
INRIA

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

Hughes’ combinatorial proofs give canonical representations for classical logic proofs. In this paper we characterize classical combinatorial proofs which also represent valid proofs for relevant logic with and without the mingle axiom. Moreover, we extend our syntax in order to represent combinatorial proofs for the more restrictive framework of entailment logic.

langue originale	Anglais
titre	Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings
rédacteurs en chef	Rosalie Iemhoff, Michael Moortgat, Ruy de Queiroz
Editeur	Springer Verlag
Pages	1-16
Nombre de pages	16
ISBN (imprimé)	9783662595329
Les DOIs	https://doi.org/10.1007/978-3-662-59533-6_1
état	Publié - 1 janv. 2019
Modification externe	Oui
Evénement	26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019 - Utrecht, Pays-Bas Durée: 2 juil. 2019 → 5 juil. 2019

Série de publications

Nom	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11541 LNCS
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019
Pays/Territoire	Pays-Bas
La ville	Utrecht
période	2/07/19 → 5/07/19

Accès au document

10.1007/978-3-662-59533-6_1

Contient cette citation

Acclavio, M., & Straßburger, L. (2019). On Combinatorial Proofs for Logics of Relevance and Entailment. Dans R. Iemhoff, M. Moortgat, & R. de Queiroz (eds.), Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings (p. 1-16). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 11541 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-59533-6_1

Acclavio, Matteo ; Straßburger, Lutz. / On Combinatorial Proofs for Logics of Relevance and Entailment. Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. Editeur / Rosalie Iemhoff ; Michael Moortgat ; Ruy de Queiroz. Springer Verlag, 2019. p. 1-16 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1f207b8597464a248ae6882e7889b1a4,

title = "On Combinatorial Proofs for Logics of Relevance and Entailment",

abstract = "Hughes{\textquoteright} combinatorial proofs give canonical representations for classical logic proofs. In this paper we characterize classical combinatorial proofs which also represent valid proofs for relevant logic with and without the mingle axiom. Moreover, we extend our syntax in order to represent combinatorial proofs for the more restrictive framework of entailment logic.",

keywords = "Combinatorial proofs, Entailment logic, Proof theory, Relevant logic, Skew fibrations",

author = "Matteo Acclavio and Lutz Stra{\ss}burger",

note = "Publisher Copyright: {\textcopyright} 2019, Springer-Verlag GmbH Germany, part of Springer Nature.; 26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019 ; Conference date: 02-07-2019 Through 05-07-2019",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-662-59533-6\_1",

language = "English",

isbn = "9783662595329",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--16",

editor = "Rosalie Iemhoff and Michael Moortgat and \{de Queiroz\}, Ruy",

booktitle = "Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings",

}

Acclavio, M & Straßburger, L 2019, On Combinatorial Proofs for Logics of Relevance and Entailment. Dans R Iemhoff, M Moortgat & R de Queiroz (eds), Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOL. 11541 LNCS, Springer Verlag, p. 1-16, 26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019, Utrecht, Pays-Bas, 2/07/19. https://doi.org/10.1007/978-3-662-59533-6_1

On Combinatorial Proofs for Logics of Relevance and Entailment. / Acclavio, Matteo; Straßburger, Lutz.
Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. Ed. / Rosalie Iemhoff; Michael Moortgat; Ruy de Queiroz. Springer Verlag, 2019. p. 1-16 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 11541 LNCS).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - On Combinatorial Proofs for Logics of Relevance and Entailment

AU - Acclavio, Matteo

AU - Straßburger, Lutz

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Hughes’ combinatorial proofs give canonical representations for classical logic proofs. In this paper we characterize classical combinatorial proofs which also represent valid proofs for relevant logic with and without the mingle axiom. Moreover, we extend our syntax in order to represent combinatorial proofs for the more restrictive framework of entailment logic.

AB - Hughes’ combinatorial proofs give canonical representations for classical logic proofs. In this paper we characterize classical combinatorial proofs which also represent valid proofs for relevant logic with and without the mingle axiom. Moreover, we extend our syntax in order to represent combinatorial proofs for the more restrictive framework of entailment logic.

KW - Combinatorial proofs

KW - Entailment logic

KW - Proof theory

KW - Relevant logic

KW - Skew fibrations

U2 - 10.1007/978-3-662-59533-6_1

DO - 10.1007/978-3-662-59533-6_1

M3 - Conference contribution

AN - SCOPUS:85068597347

SN - 9783662595329

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 16

BT - Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings

A2 - Iemhoff, Rosalie

A2 - Moortgat, Michael

A2 - de Queiroz, Ruy

PB - Springer Verlag

T2 - 26th International Workshop on Logic, Language, Information and Communication, WoLLIC 2019

Y2 - 2 July 2019 through 5 July 2019

ER -

Acclavio M, Straßburger L. On Combinatorial Proofs for Logics of Relevance and Entailment. Dans Iemhoff R, Moortgat M, de Queiroz R, rédacteurs en chef, Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, Proceedings. Springer Verlag. 2019. p. 1-16. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-59533-6_1

On Combinatorial Proofs for Logics of Relevance and Entailment

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation