This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: "False" logic – news · newspapers · books · scholar · JSTOR (March 2012) (Learn how and when to remove this template message)

In logic, **false** or **untrue** is the state of possessing negative truth value or a nullary logical connective. In a truth-functional system of propositional logic, it is one of two postulated truth values, along with its negation, truth.^{[1]} Usual notations of the false are 0 (especially in Boolean logic and computer science), O (in prefix notation, O*pq*), and the up tack symbol .^{[2]}^{[3]}

Another approach is used for several formal theories (e.g., intuitionistic propositional calculus), where a propositional constant (i.e. a nullary connective), , is introduced, the truth value of which being always false in the sense above.^{[4]}^{[5]}^{[6]} It can be treated as an absurd proposition, and is often called absurdity.

In Boolean logic, each variable denotes a truth value which can be either true (1), or false (0).

In a classical propositional calculus, each proposition will be assigned a truth value of either true or false. Some systems of classical logic include dedicated symbols for false (0 or ), while others instead rely upon formulas such as p ∧ ¬p and ¬(p → p).

In both Boolean logic and Classical logic systems, true and false are opposite with respect to negation; the negation of false gives true, and the negation of true gives false.

true | false |
---|---|

false | true |

The negation of false is equivalent to the truth not only in classical logic and Boolean logic, but also in most other logical systems, as explained below.

This section needs expansion. You can help by adding to it. (February 2012)

In most logical systems, negation, material conditional and false are related as:

- ¬p ⇔ (p → ⊥)

In fact, this is the definition of negation in some systems,^{[7]} such as intuitionistic logic, and can be proven in propositional calculi where negation is a fundamental connective. Because p → p is usually a theorem or axiom, a consequence is that the negation of false (¬ ⊥) is true.

A contradiction is the situation that arises when a statement that is assumed to be true is shown to entail false (i.e., φ ⊢ ⊥). Using the equivalence above, the fact that φ is a contradiction may be derived, for example, from ⊢ ¬φ. A statement that entails false itself is sometimes called a contradiction, and contradictions and false are sometimes not distinguished, especially due to the Latin term *falsum* being used in English to denote either, but false is one specific proposition.

Logical systems may or may not contain the principle of explosion (*ex falso quodlibet in Latin*), ⊥ ⊢ φ for all φ. By that principle, contradictions and false are equivalent, since each entails the other.

Main article: Consistency |

A formal theory using the "" connective is defined to be consistent, if and only if the false is not among its theorems. In the absence of propositional constants, some substitutes (such as the ones described above) may be used instead to define consistency.