Tree-like proof systems for finitely-many valued non-deterministic consequence relations
From MaRDI portal
Publication:2228348
DOI10.1007/S11787-020-00263-0zbMATH Open1472.03023OpenAlexW3093083956MaRDI QIDQ2228348FDOQ2228348
Authors: Pawel Pawlowski 
Publication date: 17 February 2021
Published in: Logica Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11787-020-00263-0
Recommendations
- 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
Cites Work
- Outline of a Theory of Truth
- Axiomatic theories of truth
- Title not available (Why is that?)
- An introduction to non-classical logic. From if to is
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to many-valued and fuzzy logic. Semantics, algebras, and derivation systems
- Non-deterministic Multiple-valued Structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A semantical analysis of the calculi \(C_n\)
- MUltlog 1.0: Towards an expert system for many-valued logics
- Multi-valued Calculi for Logics Based on Non-determinism
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- Systematization of finite many-valued logics through the method of tableaux
- Quasi-truth-functional systems of propositional logic
- The method of polynomial ring calculus and its potentialities
- Modal semantics without possible worlds
- Finite non-deterministic semantics for some modal systems
- Title not available (Why is that?)
- Dugundji's theorem revisited
- MANY-VALUED LOGIC OF INFORMAL PROVABILITY: A NON-DETERMINISTIC STRATEGY
- Proof systems for BAT consequence relations
Cited In (6)
- Finitely many-valued logics and natural deduction
- Analytic tableaux for non-deterministic semantics
- Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics
- Tableau systems for some Ivlev-like (quantified) modal logics
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
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)
