Some useful 16-valued logics: How a computer network should think

DOI10.1007/s10992-005-0556-5zbMath1094.03012OpenAlexW2088233901MaRDI QIDQ815018

Publication date: 8 February 2006

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

Full work available at URL: https://doi.org/10.1007/s10992-005-0556-5

zbMATH Keywords

first-degree entailment multilattices generalized truth values 16-valued logic 4-valued logic bi-consequence logic logical bilattices trilattices

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Logic in computer science (03B70) Logical aspects of lattices and related structures (03G10) Many-valued logic (03B50)

Related Items (50)

Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ Inconsistency-Tolerant Multi-Agent Calculus ⋮ Notes on Craig interpolation for LJ with strong negation ⋮ Gentzenization of trilattice logics ⋮ Modal multilattice logic ⋮ Rivals to Belnap-Dunn logic on interlaced trilattices ⋮ Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant ⋮ Provability multilattice logic ⋮ The value of the one value: \textit{exactly true logic} revisited ⋮ Conservative translations of four-valued logics in modal logic ⋮ Unnamed Item ⋮ Logical multilateralism ⋮ Basic Four-Valued Systems of Cyclic Negations ⋮ Completeness and cut-elimination theorems for trilattice logics ⋮ The power of Belnap: sequent systems for \(SIXTEEN_{3 }\) ⋮ Representation of interlaced trilattices ⋮ Suszko's thesis, inferential many-valuedness, and the notion of a logical system ⋮ On Split Negation, Strong Negation, Information, Falsification, and Verification ⋮ Truth, Falsehood, Information and Beyond: The American Plan Generalized ⋮ An Invitation to New Essays on Belnap-Dunn Logic ⋮ Two, Three, Four, Infinity: The Path to the Four-Valued Logic and Beyond ⋮ Generalizing functional completeness in Belnap-Dunn logic ⋮ Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\) ⋮ Interpolation in 16-valued trilattice logics ⋮ A hierarchy of weak double negations ⋮ Bi-facial truth: a case for generalized truth values ⋮ Paraconsistent semantics for Pavelka style fuzzy sentential logic ⋮ Processing Information from a Set of Sources ⋮ The \textsc{Fmla-Fmla} axiomatizations of the exactly true and non-falsity logics and some of their cousins ⋮ Galois connections for bilattices ⋮ Hyper-contradictions, generalized truth values and logics of truth and falsehood ⋮ Proof systems combining classical and paraconsistent negations ⋮ Editorial introduction. Truth values. I ⋮ On axiomatizing Shramko-Wansing's logic ⋮ On a multilattice analogue of a hypersequent S5 calculus ⋮ Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi ⋮ SEQUENT CALCULI FOR SOME TRILATTICE LOGICS ⋮ Constructive negation, implication, and co-implication ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\) ⋮ Two Consistent Many-Valued Logics for Paraconsistent Phenomena ⋮ Unnamed Item ⋮ A note on FDE ``all the way up ⋮ Two proofs of the algebraic completeness theorem for multilattice logic ⋮ A non-inferentialist, anti-realistic conception of logical truth and falsity ⋮ Modal multilattice logics with Tarski, Kuratowski, and Halmos operators ⋮ The Strict/Tolerant Idea and Bilattices ⋮ The logic of generalized truth values and the logic of bilattices ⋮ Another paraconsistent algebraic semantics for Lukasiewicz-Pavelka logic ⋮ Analytic tableaux for all of \(\mathrm{SIXTEEN}_3\)

Cites Work

This page was built for publication: Some useful 16-valued logics: How a computer network should think