# Finite-valued logic

In logic, a **finite-valued logic** (also **finitely many-valued logic**) is a propositional calculus in which truth values are discrete. Traditionally, in Aristotle's logic, the bivalent logic, also known as binary logic was the norm, as the law of the excluded middle precluded more than two possible values (i.e., "true" and "false") for any proposition.^{[1]} Modern three-valued logic (ternary logic) allows for an additional possible truth value (i.e. "undecided").^{[2]}

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]}

## Contents

## HistoryEdit

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 algorithmic probability theory based on bivalent logic in the 19th century.^{[14]}

Jan Łukasiewicz developed a system of three-valued logic in 1920. Emil Leon Post introduced further truth degrees in 1921.^{[15]}

Stephen Cole Kleene and U. Blau expanded the three-valued logic system of Łukasiewicz, for computer applications and for natural language analyses, repectively. 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]}

## ExamplesEdit

In linguistics, finite-valued logic is used to treat presuppositions as product systems with ordered pairs of truth degrees, or truth tables. This enables assumptions built into verbal or written statements to be associated with varying degrees of truth values in the course of natural-language processing.^{[18]}

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 mathematics, logical matrices having multiple truth degrees are used to model systems of axioms.^{[26]}

Biophysical indications suggest that in the brain, synaptic charge injections occur in finite steps,^{[27]} and that neuron arrangements can be modeled based on the probability distribution of a finitely valued random variable.^{[28]}

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]}

## See alsoEdit

## ReferencesEdit

**^**Weisstein, Eric (2018). "Law of the Excluded Middle". MathWorld--A Wolfram Web Resource.**^**Weisstein, Eric (2018). "Three-Valued Logic". MathWorld--A Wolfram Web Resource.**^**Kretzmann, Norman (1968). "IV, section 2. 'Infinitely Many' and 'Finitely Many'".*William of Sherwood's Treatise on Syncategorematic Words*. University of Minnesota Press.**^**Smith, Nicholas J.J. (2010). "Article 2.6" (PDF).*Many-Valued Logics*.*Routledge Companion to the Philosophy of Language*. Routledge.**^**Weisstein, Eric (2018). "Fuzzy Logic". MathWorld--A Wolfram Web Resource.**^**Klawltter, Warren A. (1976). "Boolean values for fuzzy sets".*Theses and Dissertations, paper 2025*. Lehigh Preserve.**^**Perović, Aleksandar (2006). "Fuzzy Sets – a Boolean Valued Approach" (PDF).*4th Serbian-Hungarian Joint Symposium on Intelligent Systems*. Conferences and Symposia @ Óbuda University.**^**Cerami, Marco; García-Cerdaña, Àngel; Esteva, Frances (2014). "On finitely-valued Fuzzy Description Logics".*International Journal of Approximate Reasoning*.**55**(9): 1890–1916. doi:10.1016/j.ijar.2013.09.021. hdl:10261/131932.**^**Schockaert, Steven; Janssen, Jeroen; Vermeir, Dirk (2012). "Satisfiability Checking in Łukasiewicz Logic as Finite Constraint Satisfaction".*Journal of Automated Reasoning*.**49**(4): 493–550. doi:10.1007/s10817-011-9227-0.**^**"1.4.4 Defuzzification" (PDF).*Fuzzy Logic*. Swiss Federal Institute of Technology Zurich. 2014. p. 4.**^**Stachniak, Zbigniew (1989). "Many-valued computational logics".*Journal of Philosophical Logic*.**18**(3): 257–274. doi:10.1007/BF00274067.**^**Folse, Henry. "The Aristotelian Theory of Knowledge". Department of Philosophy, College of Arts and Sciences, Loyola University.**^**Rescher, Nicholas (1968). "Many-Valued Logic".*Topics in Philosophical Logic*. Humanities Press Synthese Library volume 17. pp. 54–125. doi:10.1007/978-94-017-3546-9_6. ISBN 978-90-481-8331-9.**^**Kuphaldt, Tony. "7".*Introduction to Boolean Algebra*.*Lessons in Electric Circuits*.**4**.**^**Gottwald, Siegfried (2015). "Many-Valued Logic".*5. History of Many-Valued Logic*. Stanford Encyclopedia of Philosophy.**^**Gottwald, Siegfried (2015). "Many-Valued Logic".*3. Systems of Many-Valued Logic*. Stanford Encyclopedia of Philosophy.**^**Caleiro, Carlos; Marcos, João (2009). "Background".*Classic-Like Analytic Tableaux for Finite-Valued Logics*(PDF).*Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings*. Springer. pp. 268–280.**^**Dubois, Didier (2011). "Uncertainty Theories, Degrees of Truth and Epistemic States" (PDF). International Conference on Agents and Artificial Intelligence.**^**Rucker, Rudy.*Infinity and the Mind*. Princeton University Press., section 655 "What is Truth?"**^**Kripke, Saul (1975). "Outline of a Theory of Truth" (PDF).*The Journal of Philosophy*.**72**(19): 690–716. doi:10.2307/2024634. JSTOR 2024634.**^**Behounek, Libor (2011). "In Which Sense Is Fuzzy Logic a Logic for Vagueness?" (PDF). CEUR Workshop Proceedings.**^**Fisher, Peter (2000). "Sorites Paradox and Vague Geographies".*Fuzzy Sets and Systems*.**113**: 7–18. CiteSeerX 10.1.1.409.905. doi:10.1016/S0165-0114(99)00009-3.**^**Krupinski, Joseph (1962). "Logic Design for Tristable Devices" (PDF). Defense Technical Information Center.**^**Mouftah, H.T. (1976). "A study on the implementation of three-valued logic".*MVL '76 Proceedings of the Sixth International Symposium on Multiple-valued Logic*: 123–126.**^**Behounek, Libor; Cintula, Pitr (2006). "Fuzzy logics as the logics of chains" (PDF).*Fuzzy Sets and Systems*.**157**(5): 608. doi:10.1016/j.fss.2005.10.005.**^**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. doi:10.1109/TMBMC.2017.2655021.**^**Choudhury, Kingshuk; Deacon, Pearl; Barrett, Rob; McDermott, Kieran (2010). "Hypothesis testing for neural cell growth experiments using a hybrid branching process model".*Biostatistics*.**11**(4): 631–643. doi:10.1093/biostatistics/kxq038. PMID 20525698.**^**Burgess, John. "Intuitions of Three Kinds in Gödel's Views on the Continuum" (PDF).