To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

Tautology (rule of inference)

From Wikipedia, the free encyclopedia

In propositional logic, tautology is either of two commonly used rules of replacement.[1][2][3] The rules are used to eliminate redundancy in disjunctions and conjunctions when they occur in logical proofs. They are:

The principle of idempotency of disjunction:

and the principle of idempotency of conjunction:

Where "" is a metalogical symbol representing "can be replaced in a logical proof with."

YouTube Encyclopedic

  • 1/3
    43 448
    3 239
    11 915
  • Logic Lesson 6: Proofs with the Rules of Inference
  • Proving a compound proposition is a tautology part 2 of 2
  • CS101 - Discrete Mathematics - Rules of Inference (রুলস অব ইনফারেন্স)


Formal notation

Theorems are those logical formulas where is the conclusion of a valid proof,[4] while the equivalent semantic consequence indicates a tautology.

The tautology rule may be expressed as a sequent:


where is a metalogical symbol meaning that is a syntactic consequence of , in the one case, in the other, in some logical system;

or as a rule of inference:


where the rule is that wherever an instance of "" or "" appears on a line of a proof, it can be replaced with "";

or as the statement of a truth-functional tautology or theorem of propositional logic. The principle was stated as a theorem of propositional logic by Russell and Whitehead in Principia Mathematica as:


where is a proposition expressed in some formal system.


  1. ^ Hurley, Patrick (1991). A Concise Introduction to Logic 4th edition. Wadsworth Publishing. pp. 364–5.
  2. ^ Copi and Cohen
  3. ^ Moore and Parker
  4. ^ Logic in Computer Science, p. 13
This page was last edited on 18 December 2020, at 02:18
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.