The term finitely many-valued logic is typically used to describe many-valued logic having three or more, but not infinite, truth values. The term finite-valued logic encompasses both finitely many-valued logic and bivalent logic.[3][4]Fuzzy logics, which allow for degrees of values between "true" and "false", are typically not considered forms of finite-valued logic.[5] However, finite-valued logic can be applied in Boolean-valued modeling,[6][7]description logics,[8] and defuzzification[9][10] of fuzzy logic. A finite-valued logic is decidable (sure to determine outcomes of the logic when it is applied to propositions) if and only if it has a computational semantics.[11]
History
Aristotle's collected works regarding logic, known as the Organon, describe bivalent logic primarily, though Aristotle's views may have allowed for propositions that are not actually true or false. The Organon influenced philosophers and mathematicians throughout the Enlightenment.[12][13]George Boole developed an algebraic structure and an algorithmicprobability theory based on bivalent logic in the 19th century.[14]
Stephen Cole Kleene and Ulrich Blau expanded the three-valued logic system of Łukasiewicz, for computer applications and for natural language analyses, respectively. Nuel Belnap and J. Michael Dunn developed a four-valued logic for computer applications in 1977.[16] Since the mid-1970s, various procedures for providing arbitrary finite-valued logics have been developed.[17]
In the study of formal languages, finite-valued logic has shown that encapsulating a truth predicate in a language can render the language inconsistent. Saul Kripke has built on work pioneered by Alfred Tarski[19] to demonstrate that such a truth predicate can be modeled using three-valued logic.[20]
Philosophical questions, including the Sorites paradox, have been considered based on a finite-valued logic known as fuzzy plurivaluationism.[21] The Sorites paradox suggests that if adding a grain of sand to something that is not a heap cannot create a heap, then a heap of sand cannot be created. A logical model of a heap in which there are as many truth degrees as grains of sand tends to refute that suggestion.[22]
In electronics design, a logical model of the stable states of a circuit, in which there are as many truth degrees as there are states, serves as a model for finite-valued switching.[23] Three-valued operators can be realized in integrated circuits.[24]
In fuzzy logic, typically applied for approximate reasoning, a finitely-valued logic can represent propositions that may acquire values within a finite set.[25]
In the study of logic itself, finite-valued logic has served as an aid to understand the nature and existence of infinite-valued logic. Kurt Gödel attempted to comprehend the human ability for logical intuition in terms of finite-valued logic before concluding that the ability is based on infinite-valued logic.[29]
^"1.4.4 Defuzzification"(PDF). Fuzzy Logic. Swiss Federal Institute of Technology Zurich. 2014. p. 4. Archived from the original(PDF) on 2009-07-09. Retrieved 2018-05-16.
^Gottwald, Siegfried (2015). "Many-Valued Logic". 4. Applications of Many-Valued Logic. Stanford Encyclopedia of Philosophy.
^Levy, William; Berger, Toby; Sungka, Mustafa (2016). "Neural computation from first principles: Using the maximum entropy method to obtain an optimal bits-per-joule neuron". IEEE Transactions on Molecular, Biological and Multi-Scale Communications. 2 (2): 154–165. arXiv:1606.03063. Bibcode:2016arXiv160603063L. doi:10.1109/TMBMC.2017.2655021. S2CID6537386.
