Systematization of finite many-valued logics through the method of tableaux

DOI10.2307/2274395zbMath0633.03008OpenAlexW2143810536WikidataQ56453709 ScholiaQ56453709MaRDI QIDQ3770497

Walter Alexandre Carnielli

Publication date: 1987

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274395

zbMATH Keywords

model theoryfinite many-valued logicsdistribution quantifiersmethod of Analytic Tableauxtableau type proof theory

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (28)

1998 European Summer Meeting of the Association for Symbolic Logic ⋮ On the relative merits of path dissolution and the method of analytic tableaux ⋮ Tableaux and restricted quantification for systems related to weak Kleene logic ⋮ Analytic tableaux for non-deterministic semantics ⋮ Natural 3-valued logics—characterization and proof theory ⋮ Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics ⋮ Maximal weakly-intuitionistic logics ⋮ On finite-valued propositional logical calculi ⋮ Multi-valued autoepistemic logic ⋮ Reasoning without believing: on the mechanisation of presuppositions and partiality ⋮ Two-sided sequent calculi for \textit{FDE}-like four-valued logics ⋮ Rejection in Łukasiewicz’s and Słupecki’s Sense ⋮ A functorial framework for constraint normal logic programming ⋮ Tree-like proof systems for finitely-many valued non-deterministic consequence relations ⋮ Combining many-valued and intuitionistic tableaux ⋮ MUltlog 1.0: Towards an expert system for many-valued logics ⋮ Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices ⋮ On non-deterministic quantification ⋮ Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\) ⋮ On partial and paraconsistent logics ⋮ Effective Finite-Valued Approximations of General Propositional Logics ⋮ Modulated fibring and the collapsing problem ⋮ Classic-Like Analytic Tableaux for Finite-Valued Logics ⋮ Truth-values as labels: a general recipe for labelled deduction ⋮ Optimal axiomatizations of finitely valued logics ⋮ Sequent calculi for choice logics ⋮ Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence ⋮ Cut-elimination and quantification in canonical systems

Cites Work

• A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
• Unnamed Item

This page was built for publication: Systematization of finite many-valued logics through the method of tableaux