Quote:
A correct statement is not a tautology if it is not trivial (like 0=0).
Rewriting this a few times:
1) P is a correct statement. P is not a tautology if it is not trivial.
2) P is a correct statement. If P is not trivial, then it not a tautology.
3) P is a correct statement. If P is a tautology, then P is trivial.
This is not a proper rendering of the concept. There are tautologies that are non-trivial to check. Imagine an expression of logical equivalence involving hundreds of variables.
Quote:
Originally Posted by lastcardcharlie
The main purpose of this thread is that I would like to understand how tautology and equality are related.
Equality (as in, equations) are a general way of expressing a relationship between two collections of symbols that have a value (1+1=2) or are the same mathematical object (A = B as sets).
A tautology is a more restrictive concept, pertaining to the underlying logical structure. I usually don't think of logical statements being written with equalities. For example, "not(P and Q)" is logically equivalent to "(not P) or (not Q)" which makes "not(P and Q) \equiv (not P) or (not Q)" a tautology (it's true regardless of the truth values of P and Q), but I don't think I would ever write "not(P and Q) = (not Q) or (not Q)" where I really mean that to be an equal sign and not used because I don't have a different symbol to type it in its position.