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 proceedingConference contributionpeer-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 languageEnglish
Title of host publicationLogical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings
Pages119-133
Number of pages15
DOIs
StatePublished - 2013
Externally publishedYes
EventInternational Symposium on Logical Foundations of Computer Science, LFCS 2013 - San Diego, CA, United States
Duration: 6 Jan 20138 Jan 2013

Publication series

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

Conference

ConferenceInternational Symposium on Logical Foundations of Computer Science, LFCS 2013
Country/TerritoryUnited States
CitySan Diego, CA
Period6/01/138/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
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Automated support for the investigation of paraconsistent and other logics'. Together they form a unique fingerprint.

Cite this