Generalizing functional completeness in Belnap-Dunn logic (Q497416): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / review text
 
Even though the authors in their introduction, plead for a relational semantics for the Belnap-Dunn Logic \(\mathbf{BD}\), they present a many-valued semantics with two readings of the set of truth values. One is the set of truth values \(\{t,b,n,f\}\) and the other is the set subsets of \(\{0,1\}\). The latter semantics is considered, because it can easily be transformed into relational semantics. The present paper focuses on twelve algebras starting from \( E, \{\wedge,\vee,\sim \} \) as the algebraic counterpart of \(\mathbf{BD}\), where \( E = \{t,b,n,f\}\), and furthermore eleven expansions of \(\mathbf{BD}\) enriched by a series of unary and binary operations. The first section of the paper describes an effective procedure to compute so-called Dunn conditions for an \textit{\(n\)-ary} connective \(f\) out of the truth table for \(f\), written in terms of \(\{1\}\), \(\{0,1\}\), \(\emptyset\) and \(\{0\}\). The procedure is based on splitting the truth tables into two parts, those having \(1\) only and those having \(0\) only. The second section concentrates on the notion of functional completeness considered in the light of Dunn conditions. A slightly modified definition of ``functional completeness'' of \textit{G. Malinowski} [in: The Blackwell guide to philosophical logic. Oxford: Blackwell Publishers. 309--335 (2001; Zbl 0998.03021)] is presented. Results by \textit{J. Słupecki} [Stud. Log. 30, 153--157 (1972; Zbl 0273.02015)] and \textit{E. Post} [Am. J. Math. 43, 163--185 (1921; JFM 48.1122.01)] are reconsidered, generalized and applied to some of the above mentioned expansions of \(\mathbf{BD}\). Finally, the relations between the presented results and those obtained by \textit{O. Arieli} and \textit{A. Avron} [Artif. Intell. 102, No. 1, 97--141 (1998; Zbl 0928.03025)], \textit{A. Avron} [J. Log. Comput. 9, No. 6, 977--994 (1999; Zbl 0941.03012)] and \textit{A. P. Pynko} [J. Appl. Non-Class. Log. 9, No. 1, 61--105 (1999; Zbl 1033.03017)] are clarified.
Property / review text: Even though the authors in their introduction, plead for a relational semantics for the Belnap-Dunn Logic \(\mathbf{BD}\), they present a many-valued semantics with two readings of the set of truth values. One is the set of truth values \(\{t,b,n,f\}\) and the other is the set subsets of \(\{0,1\}\). The latter semantics is considered, because it can easily be transformed into relational semantics. The present paper focuses on twelve algebras starting from \( E, \{\wedge,\vee,\sim \} \) as the algebraic counterpart of \(\mathbf{BD}\), where \( E = \{t,b,n,f\}\), and furthermore eleven expansions of \(\mathbf{BD}\) enriched by a series of unary and binary operations. The first section of the paper describes an effective procedure to compute so-called Dunn conditions for an \textit{\(n\)-ary} connective \(f\) out of the truth table for \(f\), written in terms of \(\{1\}\), \(\{0,1\}\), \(\emptyset\) and \(\{0\}\). The procedure is based on splitting the truth tables into two parts, those having \(1\) only and those having \(0\) only. The second section concentrates on the notion of functional completeness considered in the light of Dunn conditions. A slightly modified definition of ``functional completeness'' of \textit{G. Malinowski} [in: The Blackwell guide to philosophical logic. Oxford: Blackwell Publishers. 309--335 (2001; Zbl 0998.03021)] is presented. Results by \textit{J. Słupecki} [Stud. Log. 30, 153--157 (1972; Zbl 0273.02015)] and \textit{E. Post} [Am. J. Math. 43, 163--185 (1921; JFM 48.1122.01)] are reconsidered, generalized and applied to some of the above mentioned expansions of \(\mathbf{BD}\). Finally, the relations between the presented results and those obtained by \textit{O. Arieli} and \textit{A. Avron} [Artif. Intell. 102, No. 1, 97--141 (1998; Zbl 0928.03025)], \textit{A. Avron} [J. Log. Comput. 9, No. 6, 977--994 (1999; Zbl 0941.03012)] and \textit{A. P. Pynko} [J. Appl. Non-Class. Log. 9, No. 1, 61--105 (1999; Zbl 1033.03017)] are clarified. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Albert Hoogewijs / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6484955 / rank
 
Normal rank
Property / zbMATH Keywords
 
Belnap-Dunn logic
Property / zbMATH Keywords: Belnap-Dunn logic / rank
 
Normal rank
Property / zbMATH Keywords
 
functional completeness
Property / zbMATH Keywords: functional completeness / rank
 
Normal rank
Property / zbMATH Keywords
 
relational semantics
Property / zbMATH Keywords: relational semantics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11225-014-9597-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073514978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with logical bilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value of the four values / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of antinomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of three-valued and four-valued languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propositional logic with 4 values: true, false, divergent and meaningless / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of philosophical logic. Vol. 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics of Formal Inconsistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal inconsistency and evolutionary databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contradictory information: too much of a good thing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kleene's Logic, Generalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations into the system of intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is a non-truth-functional logic? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partial and paraconsistent logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: da Costa Meets Belnap and Nelson / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3518425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expansion of first-order Belnap-Dunn logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some useful 16-valued logics: How a computer network should think / rank
 
Normal rank
Property / cites work
 
Property / cites work: A criterion of fullness of many-valued systems of propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2710098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of Belnap: sequent systems for \(SIXTEEN_{3 }\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3003846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jerzy Słupecki (1904-1987): Life and work / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:11, 10 July 2024

scientific article
Language Label Description Also known as
English
Generalizing functional completeness in Belnap-Dunn logic
scientific article

    Statements

    Generalizing functional completeness in Belnap-Dunn logic (English)
    0 references
    0 references
    0 references
    24 September 2015
    0 references
    Even though the authors in their introduction, plead for a relational semantics for the Belnap-Dunn Logic \(\mathbf{BD}\), they present a many-valued semantics with two readings of the set of truth values. One is the set of truth values \(\{t,b,n,f\}\) and the other is the set subsets of \(\{0,1\}\). The latter semantics is considered, because it can easily be transformed into relational semantics. The present paper focuses on twelve algebras starting from \( E, \{\wedge,\vee,\sim \} \) as the algebraic counterpart of \(\mathbf{BD}\), where \( E = \{t,b,n,f\}\), and furthermore eleven expansions of \(\mathbf{BD}\) enriched by a series of unary and binary operations. The first section of the paper describes an effective procedure to compute so-called Dunn conditions for an \textit{\(n\)-ary} connective \(f\) out of the truth table for \(f\), written in terms of \(\{1\}\), \(\{0,1\}\), \(\emptyset\) and \(\{0\}\). The procedure is based on splitting the truth tables into two parts, those having \(1\) only and those having \(0\) only. The second section concentrates on the notion of functional completeness considered in the light of Dunn conditions. A slightly modified definition of ``functional completeness'' of \textit{G. Malinowski} [in: The Blackwell guide to philosophical logic. Oxford: Blackwell Publishers. 309--335 (2001; Zbl 0998.03021)] is presented. Results by \textit{J. Słupecki} [Stud. Log. 30, 153--157 (1972; Zbl 0273.02015)] and \textit{E. Post} [Am. J. Math. 43, 163--185 (1921; JFM 48.1122.01)] are reconsidered, generalized and applied to some of the above mentioned expansions of \(\mathbf{BD}\). Finally, the relations between the presented results and those obtained by \textit{O. Arieli} and \textit{A. Avron} [Artif. Intell. 102, No. 1, 97--141 (1998; Zbl 0928.03025)], \textit{A. Avron} [J. Log. Comput. 9, No. 6, 977--994 (1999; Zbl 0941.03012)] and \textit{A. P. Pynko} [J. Appl. Non-Class. Log. 9, No. 1, 61--105 (1999; Zbl 1033.03017)] are clarified.
    0 references
    Belnap-Dunn logic
    0 references
    functional completeness
    0 references
    relational semantics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers