This article needs additional citations for verification. (February 2012) (Learn how and when to remove this template message)
Computing [ edit ]
In some programming languages, any expression can be evaluated in a context that expects a Boolean data type. Typically (though this varies by programming language) expressions like the number zero, the empty string, empty lists, and null evaluate to false, and strings with content (like "abc"), other numbers, and objects evaluate to true. Sometimes these classes of expressions are called "truthy" and "falsey".
Classical logic [ edit ]
true with false and
conjunction with disjunction
In classical logic, with its intended semantics, the truth values are true (denoted by 1 or the verum ⊤), and untrue or false (denoted by 0 or the falsum ⊥); that is, classical logic is a two-valued logic. This set of two values is also called the Boolean domain. Corresponding semantics of logical connectives are truth functions, whose values are expressed in the form of truth tables. Logical biconditional becomes the equality binary relation, and negation becomes a bijection which permutes true and false. Conjunction and disjunction are dual with respect to negation, which is expressed by De Morgan's laws:
- ¬(p∧q) ⇔ ¬p ∨ ¬q
- ¬(p∨q) ⇔ ¬p ∧ ¬q
Intuitionistic and constructive logic [ edit ]
In intuitionistic logic, and more generally, constructive mathematics, statements are assigned a truth value only if they can be given a constructive proof. It starts with a set of axioms, and a statement is true if one can build a proof of the statement from those axioms. A statement is false if one can deduce a contradiction from it. This leaves open the possibility of statements that have not yet been assigned a truth value. Unproven statements in intuitionistic logic are not given an intermediate truth value (as is sometimes mistakenly asserted). Indeed, one can prove that they have no third truth value, a result dating back to Glivenko in 1928.
Instead, statements simply remain of unknown truth value, until they are either proven or disproven.
Multi-valued logic [ edit ]
Multi-valued logics (such as fuzzy logic and relevance logic) allow for more than two truth values, possibly containing some internal structure. For example, on the unit interval [0,1] such structure is a total order; this may be expressed as the existence of various degrees of truth.
Algebraic semantics [ edit ]
Not all logical systems are truth-valuational in the sense that logical connectives may be interpreted as truth functions. For example, intuitionistic logic lacks a complete set of truth values because its semantics, the Brouwer–Heyting–Kolmogorov interpretation, is specified in terms of provability conditions, and not directly in terms of the necessary truth of formulae.
But even non-truth-valuational logics can associate values with logical formulae, as is done in algebraic semantics. The algebraic semantics of intuitionistic logic is given in terms of Heyting algebras, compared to Boolean algebra semantics of classical propositional calculus.
In other theories [ edit ]
Topos theory uses truth values in a special sense: the truth values of a topos are the global elements of the subobject classifier. Having truth values in this sense does not make a logic truth valuational.
See also [ edit ]
- Bayesian probability
- Circular reasoning
- Degree of truth
- False dilemma
- History of logic § Algebraic period
- Semantic theory of truth
- Slingshot argument
- Truth-value semantics
References [ edit ]
- Shramko, Yaroslav; Wansing, Heinrich (2018). Zalta, Edward N. (ed.). The Stanford Encyclopedia of Philosophy (Spring 2018 ed.). Metaphysics Research Lab, Stanford University. [dead link]
- Proof that intuitionistic logic has no third truth value, Glivenko 1928