@article{5973e86544f34951ba97eb56f1b8e429,
title = "Finite-valued semantics for canonical labelled calculi",
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 = "Canonical calculi, Cut-admissibility, Finite-valued logics, Labelled sequents, Non-deterministic semantics, Sequent calculi",
author = "Matthias Baaz and Ori Lahav and Anna Zamansky",
note = "Funding Information: The second author is supported by The Israel Science Foundation (grant no. 280-10) and by FWF START Y544-N23. The third author is supported by The European Community{\textquoteright}s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 252314.",
year = "2013",
month = dec,
doi = "10.1007/s10817-013-9273-x",
language = "אנגלית",
volume = "51",
pages = "401--430",
journal = "Journal of Automated Reasoning",
issn = "0168-7433",
publisher = "Springer Netherlands",
number = "4",
}