Finite-valued semantics for canonical labelled calculi

Matthias Baaz; Ori Lahav; Anna Zamansky

doi:10.1007/s10817-013-9273-x

Finite-valued semantics for canonical labelled calculi

Matthias Baaz, Ori Lahav, Anna Zamansky

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	401-430
Number of pages	30
Journal	Journal of Automated Reasoning
Volume	51
Issue number	4
DOIs	https://doi.org/10.1007/s10817-013-9273-x
State	Published - Dec 2013
Externally published	Yes

Bibliographical 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’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 252314.

Keywords

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

ASJC Scopus subject areas

Software
Computational Theory and Mathematics
Artificial Intelligence

Access to Document

10.1007/s10817-013-9273-x

Cite this

@article{f2c581299a8447b7b082efa38cd58f97,

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 = "English",

volume = "51",

pages = "401--430",

journal = "Journal of Automated Reasoning",

issn = "0168-7433",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - Finite-valued semantics for canonical labelled calculi

AU - Baaz, Matthias

AU - Lahav, Ori

AU - Zamansky, Anna

N1 - 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’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 252314.

PY - 2013/12

Y1 - 2013/12

N2 - 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.

AB - 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.

KW - Canonical calculi

KW - Cut-admissibility

KW - Finite-valued logics

KW - Labelled sequents

KW - Non-deterministic semantics

KW - Sequent calculi

UR - http://www.scopus.com/inward/record.url?scp=84890129536&partnerID=8YFLogxK

U2 - 10.1007/s10817-013-9273-x

DO - 10.1007/s10817-013-9273-x

M3 - Article

AN - SCOPUS:84890129536

SN - 0168-7433

VL - 51

SP - 401

EP - 430

JO - Journal of Automated Reasoning

JF - Journal of Automated Reasoning

IS - 4

ER -

Finite-valued semantics for canonical labelled calculi

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this