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. Usual notations of the false are 0 (especially in Boolean logic and computer science), O (in prefix notation, Opq), and the up tack symbol ⊥.
Another approach is used for several formal theories (for example, 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. It can be treated as an absurd proposition and is often called absurdity.
In classical logic and Boolean logic
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 ⊥), 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.
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.
False, negation and contradiction
- ¬p ⇔ (p → ⊥)
This is the definition of negation in some systems, 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.
The contradiction is a statement which entails the false, i.e. φ ⊢ ⊥. Using the equivalence above, the fact that φ is a contradiction may be derived, for example, from ⊢ ¬φ. Contradiction and the false are sometimes not distinguished, especially due to Latin term falsum denoting both. Contradiction means a statement is proven to be false, but the false itself is a proposition which is defined to be opposite to the truth.
A formal theory using "⊥" 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 mentioned above may be used instead to define consistency.
- Jennifer Fisher, On the Philosophy of Logic, Thomson Wadsworth, 2007, ISBN 0-495-00888-5, p. 17.
- Willard Van Orman Quine, Methods of Logic, 4th ed, Harvard University Press, 1982, ISBN 0-674-57176-2, p. 34.
- George Edward Hughes and D.E. Londey, The Elements of Formal Logic, Methuen, 1965, p. 151.
- Leon Horsten and Richard Pettigrew, Continuum Companion to Philosophical Logic, Continuum International Publishing Group, 2011, ISBN 1-4411-5423-X, p. 199.
- Graham Priest, An Introduction to Non-Classical Logic: From If to Is, 2nd ed, Cambridge University Press, 2008, ISBN 0-521-85433-4, p. 105.
- Dov M. Gabbay and Franz Guenthner (eds), Handbook of Philosophical Logic, Volume 6, 2nd ed, Springer, 2002, ISBN 1-4020-0583-0, p. 12.