Journal of Automated Reasoning

, Volume 51, Issue 4, pp 401–430

Finite-valued Semantics for Canonical Labelled Calculi

Article

DOI: 10.1007/s10817-013-9273-x

Cite this article as:
Baaz, M., Lahav, O. & Zamansky, A. J Autom Reasoning (2013) 51: 401. doi:10.1007/s10817-013-9273-x

Abstract

We define a general family of canonical labelled calculi, of which many previously studied sequent and labelled calculi are particular instances. We then provide a uniform and modular method to obtain finite-valued semantics for every canonical labelled calculus by introducing the notion of partial non-deterministic matrices. The semantics is applied to provide simple decidable semantic criteria for two crucial syntactic properties of these calculi: (strong) analyticity and cut-admissibility. Finally, we demonstrate an application of this framework for a large family of paraconsistent logics.

Keywords

Sequent calculi Labelled sequents Canonical calculi Cut-admissibility Non-deterministic semantics Finite-valued logics 

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Vienna University of TechnologyWienAustria
  2. 2.Tel Aviv UniversityTel AvivIsrael

Personalised recommendations