IJCAR 2012: Automated Reasoning pp 52-66

Effective Finite-Valued Semantics for Labelled Calculi

  • Matthias Baaz
  • Ori Lahav
  • Anna Zamansky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7364)

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

Personalised recommendations