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
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 -