Modular construction of cut-free sequent calculi for paraconsistent logics

Arnon Avron; Beata Konikowska; Anna Zamansky

doi:10.1109/LICS.2012.20

Modular construction of cut-free sequent calculi for paraconsistent logics

Arnon Avron^*, Beata Konikowska, Anna Zamansky

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

18 Scopus citations

Abstract

This paper makes a substantial step towards automatization of Para consistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of Para consistent logics known as Logics of Formal (In)consistency. The method relies on the use of non-deterministic semantics for these logics.

Original language	English
Title of host publication	Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012
Pages	85-94
Number of pages	10
DOIs	https://doi.org/10.1109/LICS.2012.20
State	Published - 2012
Event	2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012 - Dubrovnik, Croatia Duration: 25 Jun 2012 → 28 Jun 2012

Publication series

Name	Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

Conference

Conference	2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012
Country/Territory	Croatia
City	Dubrovnik
Period	25/06/12 → 28/06/12

Keywords

Multivalued logic
Nondeterministic semantics
Paraconsistent logic
Proof theory

Access to Document

10.1109/LICS.2012.20

Cite this

Avron, A., Konikowska, B., & Zamansky, A. (2012). Modular construction of cut-free sequent calculi for paraconsistent logics. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012 (pp. 85-94). Article 6280427 (Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012). https://doi.org/10.1109/LICS.2012.20

@inproceedings{d504aa067cbb4c2e8e41c270079a0e5f,

title = "Modular construction of cut-free sequent calculi for paraconsistent logics",

abstract = "This paper makes a substantial step towards automatization of Para consistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of Para consistent logics known as Logics of Formal (In)consistency. The method relies on the use of non-deterministic semantics for these logics.",

keywords = "Multivalued logic, Nondeterministic semantics, Paraconsistent logic, Proof theory",

author = "Arnon Avron and Beata Konikowska and Anna Zamansky",

year = "2012",

doi = "10.1109/LICS.2012.20",

language = "אנגלית",

isbn = "9780769547695",

series = "Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012",

pages = "85--94",

booktitle = "Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012",

note = "2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012 ; Conference date: 25-06-2012 Through 28-06-2012",

}

Avron, A, Konikowska, B & Zamansky, A 2012, Modular construction of cut-free sequent calculi for paraconsistent logics. in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012., 6280427, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012, pp. 85-94, 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, 25/06/12. https://doi.org/10.1109/LICS.2012.20

Modular construction of cut-free sequent calculi for paraconsistent logics. / Avron, Arnon; Konikowska, Beata; Zamansky, Anna.
Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012. 2012. p. 85-94 6280427 (Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Modular construction of cut-free sequent calculi for paraconsistent logics

AU - Avron, Arnon

AU - Konikowska, Beata

AU - Zamansky, Anna

PY - 2012

Y1 - 2012

N2 - This paper makes a substantial step towards automatization of Para consistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of Para consistent logics known as Logics of Formal (In)consistency. The method relies on the use of non-deterministic semantics for these logics.

AB - This paper makes a substantial step towards automatization of Para consistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of Para consistent logics known as Logics of Formal (In)consistency. The method relies on the use of non-deterministic semantics for these logics.

KW - Multivalued logic

KW - Nondeterministic semantics

KW - Paraconsistent logic

KW - Proof theory

UR - http://www.scopus.com/inward/record.url?scp=84867155039&partnerID=8YFLogxK

U2 - 10.1109/LICS.2012.20

DO - 10.1109/LICS.2012.20

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84867155039

SN - 9780769547695

T3 - Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

SP - 85

EP - 94

BT - Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

T2 - 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

Y2 - 25 June 2012 through 28 June 2012

ER -

Modular construction of cut-free sequent calculi for paraconsistent logics

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this