Tautology

From New World Encyclopedia
Revision as of 02:45, 1 July 2006 by Laura Brooks (talk | contribs)

Tautologies are self evident truths, that require no assumptions to determine their veracity. Within the study of logic, a tautology is a statement containing more than one sub-statement, that is true regardless of the truth values of its parts. For example, the statement "Either all crows are black, or not all of them are," is a tautology, because it is true no matter what color crows are. Expressing this formally, as a proposition with X representing "All crows are black" would give

,

which is a tautology, denoted , because regardless of the truth value of X, one of the disjuncts is true, making the whole statement true. The symbol means a "generic" tautology in contexts where any old tautology will do, without being specific about exactly where the tautology lies.


A statement such as

that is always false regardless of the truth values of its parts is known as a contradiction on an inconsistency and is denoted .

In propositional logic, the symbol or may be placed before a sentence or formuale to indicate that it is a tautology. The blank to the left of the symbol means that no assumptions are required to logically deduce the material to the right of the symbol. So it is true to say:

Two key truths about tautology are 1) and 2) . So a non-tautology is an inconsistency and a non-inconsistency is a tautology.


Tautologies versus validities

In predicate logic, a distinction is often made between tautologies and validities (or logical truths). From this perspective, a statement is considered a tautology if and only if it is a validity in propositional logic (that is, when everything within the scope of a quantifier is viewed as a black box). So for example the statement

would be a tautology because it can be rewritten in the form

and this is a tautology. In contrast, the statement

would be a validity but not a tautology, even though it is true in every possible interpretation, because there is no way to express it as a tautology in propositional logic. This distinction is not always observed.

Discovering tautologies

An effective procedure for checking whether a propositional formula is a tautology or not is by means of truth tables. As an efficient procedure, however, truth tables are constrained by the fact that the number of logical interpretations (or truth-value assignments) that have to be checked increases as 2k, where k is the number of variables in the formula. Algebraic, symbolic, or transformational methods of simplifying formulas quickly become a practical necessity to overcome the "brute-force", exhaustive search strategies of tabular decision procedures.

See also

Normal forms

  • Algebraic normal form
  • Conjunctive normal form
  • Disjunctive normal form

Related topics

  • Boolean algebra
  • Boolean domain
  • Boolean function
  • Boolean logic

  • Table of logic symbols
  • Truth table
  • Vacuous truth
  • Zeroth order logic

Credits

New World Encyclopedia writers and editors rewrote and completed the Wikipedia article in accordance with New World Encyclopedia standards. This article abides by terms of the Creative Commons CC-by-sa 3.0 License (CC-by-sa), which may be used and disseminated with proper attribution. Credit is due under the terms of this license that can reference both the New World Encyclopedia contributors and the selfless volunteer contributors of the Wikimedia Foundation. To cite this article click here for a list of acceptable citing formats.The history of earlier contributions by wikipedians is accessible to researchers here:

The history of this article since it was imported to New World Encyclopedia:

Note: Some restrictions may apply to use of individual images which are separately licensed.