Tree-like proof systems for finitely-many valued non-deterministic consequence relations
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.
- On poly-logistic natural-deduction for finitely-valued propositional logics
- Proof search and co-NP completeness for many-valued logics
- Finitely many-valued logics and natural deduction
- Proof theory for locally finite many-valued logics: semi-projective logics
- scientific article; zbMATH DE number 446843
- A semantical analysis of the calculi \(C_n\)
- An introduction to many-valued and fuzzy logic. Semantics, algebras, and derivation systems
- An introduction to non-classical logic. From if to is
- Axiomatic theories of truth
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- Dugundji's theorem revisited
- Finite non-deterministic semantics for some modal systems
- scientific article; zbMATH DE number 5959536 (Why is no real title available?)
- scientific article; zbMATH DE number 1303449 (Why is no real title available?)
- scientific article; zbMATH DE number 1735919 (Why is no real title available?)
- scientific article; zbMATH DE number 1765698 (Why is no real title available?)
- scientific article; zbMATH DE number 2213620 (Why is no real title available?)
- scientific article; zbMATH DE number 4187771 (Why is no real title available?)
- scientific article; zbMATH DE number 3032489 (Why is no real title available?)
- Many-valued logic of informal provability: a non-deterministic strategy
- Modal semantics without possible worlds
- Multi-valued Calculi for Logics Based on Non-determinism
- MUltlog 1.0: towards an expert system for many-valued logics
- Non-deterministic Multiple-valued Structures
- Outline of a Theory of Truth
- Proof systems for BAT consequence relations
- Quasi-truth-functional systems of propositional logic
- Systematization of finite many-valued logics through the method of tableaux
- The method of polynomial ring calculus and its potentialities
- Analytic tableaux for non-deterministic semantics
- Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics
- scientific article; zbMATH DE number 2086603 (Why is no real title available?)
- A Note on Calculi for Non-deterministic Many-valued Logics
- Finitely many-valued logics and natural deduction
- On poly-logistic natural-deduction for finitely-valued propositional logics
- scientific article; zbMATH DE number 7650825 (Why is no real title available?)
- Axiomatizing non-deterministic many-valued generalized consequence relations
- Tableau systems for some Ivlev-like (quantified) modal logics
- Nondeterministic first-order T-BAT logic
- Boolean and modal connectives as primitives in non-deterministic semantics
This page was built for publication: Tree-like proof systems for finitely-many valued non-deterministic consequence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228348)
