Tautological Proposition

A Tautological Proposition is a true proposition that must be true for every possible interpretation.

• AKA: Tautological Sentence, Tautology (Logic).
• Context:
  • It can (typically) refer to a Propositional Sentence.
• Example(s):
  • [math]\displaystyle{ A ∨ ¬A }[/math].
  • [math]\displaystyle{ (A→B)↔(¬A∨B) }[/math]
• Counter-Example(s):
  • a False Proposition.
• See: Contradictory Logic Sentence, Well-Formed Formula, Propositional Logic, Tee (Symbol).

---

---

References

2013

• (Wikipedia, 2013) ⇒ http://en.wikipedia.org/wiki/tautology_(logic) Retrieved:2013-12-27.
  • In logic, a 'tautology (from the Greek word ταυτολογία) is a formula which is true in every possible interpretation. Philosopher Ludwig Wittgenstein first applied the term to redundancies of propositional logic in 1921; it had been used earlier to refer to rhetorical tautologies, and continues to be used in that alternate sense.

    A formula is satisfiable if it is true under at least one interpretation, and thus a tautology is a formula whose negation is unsatisfiable. Unsatisfiable statements, both through negation and affirmation, are known formally as contradictions. A formula that is neither a tautology nor a contradiction is said to be logically contingent. Such a formula can be made either true or false based on the values assigned to its propositional variables. The double turnstile notation [math]\displaystyle{ \vDash S }[/math] is used to indicate that S is a tautology. Tautology is sometimes symbolized by "Vpq”, and contradiction by "Opq". The tee symbol [math]\displaystyle{ \top }[/math] is sometimes used to denote an arbitrary tautology, with the dual symbol [math]\displaystyle{ \bot }[/math] (falsum) representing an arbitrary contradiction.

    Tautologies are a key concept in propositional logic, where a tautology is defined as a propositional formula that is true under any possible Boolean valuation of its propositional variables. A key property of tautologies in propositional logic is that an effective method exists for testing whether a given formula is always satisfied (or, equivalently, whether its negation is unsatisfiable).

    The definition of tautology can be extended to sentences in predicate logic, which may contain quantifiers, unlike sentences of propositional logic. In propositional logic, there is no distinction between a tautology and a logically valid formula. In the context of predicate logic, many authors define a tautology to be a sentence that can be obtained by taking a tautology of propositional logic and uniformly replacing each propositional variable by a first-order formula (one formula per propositional variable). The set of such formulas is a proper subset of the set of logically valid sentences of predicate logic (which are the sentences that are true in every model).

2009

• WordNet.
  • (logic) a statement that is necessarily true; "the statement `he is brave or he is not brave' is a tautology"
  • useless repetition; "to say that something is `adequate enough' is a tautology"

• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Tautology_(rhetoric)
  • In rhetoric, a tautology is an unnecessary (and usually unintentional) repetition of meaning, using different words that effectively say the same thing twice (often originally from different languages). ...

• http://en.wiktionary.org/wiki/tautology
  • redundant use of words; An expression that features tautology; A statement that is true for all values of its variables

• http://www.uky.edu/~rosdatte/phi120/glossary.htm
  • tautology: A complex proposition that is always true, because of the form of the statement.

• http://mcckc.edu/longview/ctac/glossary.htm
  • Tautology : Definition: Broadly speaking, a tautology is any statement whose truth- value is True regardless of the truth-value any other statements may happen to have-- in other words, it's true in all possible situations. There are no mountains over 15,000 feet high, or there is at least one such mountain.

---