Three-valued Propositional Logic Research Articles

A Sound and Complete Tableaux Calculus for Reichenbach’s Quantum Mechanics Logic

In 1944 Hans Reichenbach developed a three-valued propositional logic (RQML) in order to account for certain causal anomalies in quantum mechanics. In this logic, the truth-value indeterminate is assigned to those statements describing physical phenomena that cannot be understood in causal terms. However, Reichenbach did not develop a deductive calculus for this logic. The aim of this paper is to develop such a calculus by means of First Degree Entailment logic (FDE) and to prove it sound and complete with respect to RQML semantics. In Section 1 we explain the main physical and philosophical motivations of RQML. Next, in Sections 2 and 3, respectively, we present RQML and FDE syntax and semantics and explain the relation between both logics. Section 4 introduces Q\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\\mathcal {Q}}$$\\end{document} calculus, an FDE-based tableaux calculus for RQML. In Section 5 we prove that Q\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\\mathcal {Q}}$$\\end{document} calculus is sound and complete with respect to RQML three-valued semantics. Finally, in Section 6 we consider some of the main advantages of Q\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\\mathcal {Q}}$$\\end{document} calculus and we apply it to Reichenbach’s analysis of causal anomalies.

Tableau method of proof for Peirce’s three-valued propositional logic

Peirce’s triadic logic has been under discussion since its discovery in the 1960s by Fisch and Turquette. The experiments with matrices of three-valued logic are recorded in a few pages of unpublished manuscripts dated 1909, a decade before similar systems have been developed by logicians. The purposes of Peirce’s work on such logic, as well as semantical aspects of his system, are disputable. In the most extensive work about it, Turquette suggested that the matrices are related in dual pairs of axiomatic Hilbert-style systems. In this paper, we present a simple tableau proof for a fragment of Peirce three-valued logic, called P3, based on similar approaches in many-valued literature. We demonstrated that this proof is sound and complete. Besides that, taking the false as the only undesignated value and adding non-classical negations to the calculus, we can explore paraconsistent and paracompleteness theories into P3. Keywords: Charles S. Peirce, many-valued logics, theory of proof, tableau method.

On Axiom Systems of S\u0142upecki for the Functionally Complete Three-Valued Logic

The article concerns two axiom systems of Słupecki for the functionally complete three-valued propositional logic: W1–W6 (from 1936) and A1–A9 (from 1946). The article proves that both of them are inadequate—W1–W6 is semantically incomplete, on the other hand, A1–A9 governs a functionally incomplete calculus, and thus, it cannot be a semantically complete axiom system for the functionally complete three-valued logic.

The Sound and Complete Gentzen Deduction System for the Modalized Łukasiewicz Three-Valued Logic

A modalized Łukasiewicz three-valued propositional logic will be proposed in this paper which there are three modalities [t]; [m]; [f] to represent the three values t; m; f; respectively. And a Gentzen-typed deduction system will be given so that the the system is sound and complete with respect to the Łukasiewicz three-valued semantics Ł 3 , which are given in soundness theorem and completeness theorem.

Three-valued Logics in Modal Logic

Abstract Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises the question whether there are three-valued logics for which there is a shorter translation into S5. The answer is affirmative: we present an elegant linear translation of the Logic of Paradox and of Strong Three-valued Logic into S5.

A Correspondence Between Variable Relations And Three-Valued Propositional Logic

Herein, relations are generalised to variable length tuple relations (variabe relations) wherein tuples are allowed to be of variable length. We define the concept of a functional dependency (FD) holding in variable relations and present a sound and complete axiom system for them. Our main result shows an equivalence between FDs holding in variable relations and propositional implications holding in (a subset of) a three-valued propositional logic. We extend this result to object relations, which are a subclass of variable relations enabling us to view tuples as objects.

Conjunctive Normal Forms In Three-valued Propositional Logics

Conjunctive Normal Forms In Three-valued Propositional Logics

On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus

A three-valued propositional logic is presented, within which the three values are read as ‘true’, ‘false’ and ‘nonsense’. A three-valued extended functional calculus, unrestricted by the theory of types, is then developed. Within the latter system, Bochvar analyzes the Russell paradox and the Grelling-Weyl paradox, formally demonstrating the meaninglessness of both.

K axiomatisaci trojhodnotové výrokové logiky

K axiomatisaci trojhodnotové výrokové logiky