Generalizing functional completeness in Belnap-Dunn logic (Q497416): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
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 |
Revision as of 23:25, 30 June 2023
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
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