Section 2.3: Tautologies

Comment: Recall that a sequent can have no premises. Such a sequent is thus of the form \( \vdash \! \varphi \).

Comment: By the definition of validity, a sequent is valid if and only if, on every truth value assignment for the sequent on which all the premises are true is also one on which the conclusion is true. But it is trivial that every truth value assignment makes all the premises of a sequent \( \vdash \! \varphi \) with no premises true. So by this definition, for such a sequent to be valid, its conclusion \( \varphi \)must be true on all truth value assignments.

Comment: Equivalently, \( \vdash \! \varphi \) is valid if and only if the truth table for \( \varphi \) is true on all rows.

Example of a valid sequent without premises
 

 

Example of an invalid sequent without premises
 

Definition: A sentence \( \varphi \) is a tautology (or is tautologous ) if and only if the sequent \( \vdash \varphi \) is valid.

Equivalently:

Alternative Definition: A sentence \( \varphi \) is a tautology (or is tautologous ) if and only if it is true on every row of its truth table.

Definition: A sentence \( \varphi \) is inconsistent iff it is true on no truth value assignments.

Equivalently:

Alternative Definition: A sentence \( \varphi \) is inconsistent iff it is false on every row of its truth table.

Example of an inconsistent sentence
 

Definition: A sentence \( \varphi \) is inconsistent iff it is true on no truth value assignments.

Equivalently:

Alternative Definition: A sentence \( \varphi \) is inconsistent iff it is true on no rows of its truth table.

Definition: A sentence \( \varphi \) is contingent iff it is neither tautologous nor inconsistent.

Equivalently:

Theorem: A sentence \( \varphi \) is contingent iff it is true on at least one row of its truth table and false on at least one row of its truth table.
 


About this document ...



http://philebus.tamu.edu/~cmenzel/240/LectureNotes/Sec2.3
Last updated Tue 31 Mar 1998