Finite-valued semantics for canonical labelled calculi

Matthias Baaz, Ori Lahav*, Anna Zamansky

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

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 languageEnglish
Pages (from-to)401-430
Number of pages30
JournalJournal of Automated Reasoning
Volume51
Issue number4
DOIs
StatePublished - Dec 2013

Funding

FundersFunder number
Seventh Framework Programme252314
Austrian Science FundSTART Y544-N23
Israel Science Foundation280-10

    Keywords

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

    Fingerprint

    Dive into the research topics of 'Finite-valued semantics for canonical labelled calculi'. Together they form a unique fingerprint.

    Cite this