Effective Finite-Valued Semantics for Labelled Calculi

  • Matthias Baaz
  • Ori Lahav
  • Anna Zamansky
Conference paper

DOI: 10.1007/978-3-642-31365-3_7

Volume 7364 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Baaz M., Lahav O., Zamansky A. (2012) Effective Finite-Valued Semantics for Labelled Calculi. In: Gramlich B., Miller D., Sattler U. (eds) Automated Reasoning. IJCAR 2012. Lecture Notes in Computer Science, vol 7364. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Matthias Baaz
    • 1
  • Ori Lahav
    • 2
  • Anna Zamansky
    • 1
  1. 1.Vienna University of TechnologyAustria
  2. 2.Tel Aviv UniversityIsrael