Tree-like proof systems for finitely-many valued non-deterministic consequence relations
type: Item
instance of: scholarly article
title: Tree-like proof systems for finitely-many valued non-deterministic consequence relations
zbMATH Open document ID: 1472.03023
author: Pawel Pawlowski
published in: Logica Universalis
publication date: 2021-02-17T00:00:00Z
review text: An abstract framework for sequent-based proof systems for non-deterministic logics were constructed in [\textit{A. Avron} and \textit{L. Lev}, J. Log. Comput. 15, No. 3, 241--261 (2005; Zbl 1070.03010)]. The current paper presents an abstract framework for constructing tree-like (tableaux) proof systems for finitely-many valued deterministic and non-deterministic consequence relations. This framework is quite general and there is a mechanical procedure for finding a counter-model for any invalid inference which is an advantage over sequent-based systems. The framework is illustrated for the paraconsistent weak Kleene logic PKW [\textit{S. Bonzio} et al., Stud. Log. 105, No. 2, 253--297 (2017; Zbl 1417.03191)] as a deterministic example and for the non-deterministic examples CLuN [\textit{D. Batens} and \textit{K. De Clercq}, Log. Anal., Nouv. Sér. 47, No. 185--188, 227--257 (2004; Zbl 1078.03024)] and BAT [the author, Log. J. IGPL 26, No. 1, 96--108 (2018; Zbl 1499.03058); the author and \textit{R. Urbaniak}, Rev. Symb. Log. 11, No. 2, 207--223 (2018; Zbl 1502.03005)]. It is shown that the proof systems generated by the framework are complete.
reviewed by: Albert Hoogewijs
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 03B60
zbMATH DE Number: 7311772
zbMATH Keywords: many-valued logics
zbMATH Keywords: proof systems
zbMATH Keywords: non-deterministic logics
describes a project that uses: MUltlog
MaRDI profile type: MaRDI publication profile
full work available at URL: s11787-020-00263-0
OpenAlex ID: W3093083956
cites work: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
cites work: Multi-valued Calculi for Logics Based on Non-determinism
cites work: Q4539639
cites work: Non-deterministic Multiple-valued Structures
cites work: MUltlog 1.0: Towards an expert system for many-valued logics
cites work: Q4250060
cites work: Q4329282
cites work: Q5695174
cites work: Q5387443
cites work: Q5772179
cites work: The method of polynomial ring calculus and its potentialities
cites work: Systematization of finite many-valued logics through the method of tableaux
cites work: Finite non-deterministic semantics for some modal systems
cites work: Dugundji's theorem revisited
cites work: A semantical analysis of the calculi \(C_n\)
cites work: Q3005147
cites work: Q3093483
cites work: Q5752543
cites work: Modal semantics without possible worlds
cites work: Outline of a Theory of Truth
cites work: Proof systems for BAT consequence relations
cites work: MANY-VALUED LOGIC OF INFORMAL PROVABILITY: A NON-DETERMINISTIC STRATEGY
cites work: Q3518425
cites work: Quasi-truth-functional systems of propositional logic
DOI: 10.1007/S11787-020-00263-0
description: scientific article; zbMATH DE number 7311772