Effective finite-valued semantics for labelled calculi

Matthias Baaz, Ori Lahav, Anna Zamansky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We provide a systematic and modular method to define non-deterministic finite-valued semantics for a natural and very general family of canonical labelled calculi, of which many previously studied sequent and labelled calculi are particular instances. This semantics is effective, in the sense that it naturally leads to a decision procedure for these calculi. It is then applied to provide simple decidable semantic criteria for crucial syntactic properties of these calculi, namely (strong) analyticity and cut-admissibility.

Original languageEnglish
Title of host publicationAutomated Reasoning - 6th International Joint Conference, IJCAR 2012, Proceedings
Pages52-66
Number of pages15
DOIs
StatePublished - 2012
Externally publishedYes
Event6th International Joint Conference on Automated Reasoning, IJCAR 2012 - Manchester, United Kingdom
Duration: 26 Jun 201229 Jun 2012

Publication series

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

Conference

Conference6th International Joint Conference on Automated Reasoning, IJCAR 2012
Country/TerritoryUnited Kingdom
CityManchester
Period26/06/1229/06/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Effective finite-valued semantics for labelled calculi'. Together they form a unique fingerprint.

Cite this