Modular construction of cut-free sequent calculi for paraconsistent logics

Arnon Avron*, Beata Konikowska, Anna Zamansky

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012
Pages85-94
Number of pages10
DOIs
StatePublished - 2012
Event2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012 - Dubrovnik, Croatia
Duration: 25 Jun 201228 Jun 2012

Publication series

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

Conference

Conference2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012
Country/TerritoryCroatia
CityDubrovnik
Period25/06/1228/06/12

Keywords

  • Multivalued logic
  • Nondeterministic semantics
  • Paraconsistent logic
  • Proof theory

Fingerprint

Dive into the research topics of 'Modular construction of cut-free sequent calculi for paraconsistent logics'. Together they form a unique fingerprint.

Cite this