Automated support for the investigation of paraconsistent and other logics

Agata Ciabattoni; Ori Lahav; Lara Spendier; Anna Zamansky

doi:10.1007/978-3-642-35722-0_9

Automated support for the investigation of paraconsistent and other logics

Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky

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

Abstract

We automate the construction of analytic sequent calculi and effective semantics for a large class of logics formulated as Hilbert calculi. Our method applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.

Original language	English
Title of host publication	Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings
Pages	119-133
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-35722-0_9
State	Published - 2013
Externally published	Yes
Event	International Symposium on Logical Foundations of Computer Science, LFCS 2013 - San Diego, CA, United States Duration: 6 Jan 2013 → 8 Jan 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7734 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Symposium on Logical Foundations of Computer Science, LFCS 2013
Country/Territory	United States
City	San Diego, CA
Period	6/01/13 → 8/01/13

Bibliographical note

Funding Information:
Work supported by the Israel Science Foundation (grant no. 280-10), the EC Marie Curie Fellowship (NDMANCL-252314), and FWF START Y544-N23.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-35722-0_9

Cite this

Ciabattoni, A., Lahav, O., Spendier, L., & Zamansky, A. (2013). Automated support for the investigation of paraconsistent and other logics. In Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings (pp. 119-133). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7734 LNCS). https://doi.org/10.1007/978-3-642-35722-0_9

Ciabattoni, Agata ; Lahav, Ori ; Spendier, Lara et al. / Automated support for the investigation of paraconsistent and other logics. Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. 2013. pp. 119-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{271150318b7d41349d82a955b911bbfb,

title = "Automated support for the investigation of paraconsistent and other logics",

abstract = "We automate the construction of analytic sequent calculi and effective semantics for a large class of logics formulated as Hilbert calculi. Our method applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.",

author = "Agata Ciabattoni and Ori Lahav and Lara Spendier and Anna Zamansky",

note = "Funding Information: Work supported by the Israel Science Foundation (grant no. 280-10), the EC Marie Curie Fellowship (NDMANCL-252314), and FWF START Y544-N23.; International Symposium on Logical Foundations of Computer Science, LFCS 2013 ; Conference date: 06-01-2013 Through 08-01-2013",

year = "2013",

doi = "10.1007/978-3-642-35722-0_9",

language = "English",

isbn = "9783642357213",

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

pages = "119--133",

booktitle = "Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings",

}

Ciabattoni, A, Lahav, O, Spendier, L & Zamansky, A 2013, Automated support for the investigation of paraconsistent and other logics. in Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7734 LNCS, pp. 119-133, International Symposium on Logical Foundations of Computer Science, LFCS 2013, San Diego, CA, United States, 6/01/13. https://doi.org/10.1007/978-3-642-35722-0_9

Automated support for the investigation of paraconsistent and other logics. / Ciabattoni, Agata; Lahav, Ori; Spendier, Lara et al.
Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. 2013. p. 119-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7734 LNCS).

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

TY - GEN

T1 - Automated support for the investigation of paraconsistent and other logics

AU - Ciabattoni, Agata

AU - Lahav, Ori

AU - Spendier, Lara

AU - Zamansky, Anna

N1 - Funding Information: Work supported by the Israel Science Foundation (grant no. 280-10), the EC Marie Curie Fellowship (NDMANCL-252314), and FWF START Y544-N23.

PY - 2013

Y1 - 2013

N2 - We automate the construction of analytic sequent calculi and effective semantics for a large class of logics formulated as Hilbert calculi. Our method applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.

AB - We automate the construction of analytic sequent calculi and effective semantics for a large class of logics formulated as Hilbert calculi. Our method applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.

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

U2 - 10.1007/978-3-642-35722-0_9

DO - 10.1007/978-3-642-35722-0_9

M3 - Conference contribution

AN - SCOPUS:84885822793

SN - 9783642357213

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

SP - 119

EP - 133

BT - Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings

T2 - International Symposium on Logical Foundations of Computer Science, LFCS 2013

Y2 - 6 January 2013 through 8 January 2013

ER -

Ciabattoni A, Lahav O, Spendier L, Zamansky A. Automated support for the investigation of paraconsistent and other logics. In Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. 2013. p. 119-133. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-35722-0_9

Automated support for the investigation of paraconsistent and other logics

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this