Symbolic Logic-Truth functions[part 1]

[wikipedia]

In mathematical logic, a truth function is a function from a set of truth values to truth values. Classically the domain and range of a truth function are {truth, falsehood}, but they may have any number of truth values, including an infinity of these.

A sentence is truth-functional if the truth-value of the sentence is a function of the truth-value of its sub-sentences. A class of sentences is truth-functional if each of its members is. For example, the sentence "Apples are fruits and carrots are vegetables" is truth-functional since it is true just in case each of its sub-sentences "apples are fruits" and "carrots are vegetables" is true, and it is false otherwise. Not all sentences of a natural language, such as English, are truth-functional.

Sentences of the form "x believes that..." are typical examples of sentences that are not truth-functional. Let us say that Mary mistakenly believes that Al Gore was President of the USA on April 20, 2000, but she does not believe that the moon is made of green cheese. Then the sentence

"Mary believes that Al Gore was President of the USA on April 20, 2000"

is true while

"Mary believes that the moon is made of green cheese"

is false. In both cases, each component sentence (i.e. "Al Gore was president of the USA on April 20, 2000" and "the moon is made of green cheese") is false, but each compound sentence formed by prefixing the phrase "Mary believes that" differs in truth-value. That is, the truth-value of a sentence of the form "Mary believes that..." is not determined solely by the truth-value of its component sentence, and hence the (unary) connective (or simply operator since it is unary) is non-truth-functional.

In classical logic a truth function is a compound proposition whose truth or falsity is unequivocally determined by the truth or falsity of its components for all cases, the class of its formulas (including sentences) is truth-functional since every sentential connective (e.g. &, →, etc.) used in the construction of formulas is truth-functional. Their values for various truth-values as argument are usually given by truth tables. Truth-functional propositional calculus is a formal system whose formulas may be interpreted as either true or false.

Boolian Function[part 1]

Contradiction/False Notation Equivalent formulas Truth table Venn diagram "bottom" P  ¬P Opq Q 0 1 P 0    0   0  1    0   0	Tautology/True Notation Equivalent formulas Truth table Venn diagram "top" P  ¬P Vpq Q 0 1 P 0    1   1  1    1   1
Proposition P Notation Equivalent formulas Truth table Venn diagram P p Ipq Q 0 1 P 0    0   0  1    1   1	Negation of P Notation Equivalent formulas Truth table Venn diagram ¬P ~P Np Fpq Q 0 1 P 0    1   1  1    0   0
Proposition Q Notation Equivalent formulas Truth table Venn diagram Q q Hpq Q 0 1 P 0    0   1  1    0   1	Negation of Q Notation Equivalent formulas Truth table Venn diagram ¬Q ~Q Nq Gpq Q 0 1 P 0    1   0  1    1   0
Conjunction Notation Equivalent formulas Truth table Venn diagram P  Q P & Q P · Q P AND Q P ¬Q ¬P  Q ¬P  ¬Q Kpq Q 0 1 P 0    0   0  1    0   1	Alternative denial Notation Equivalent formulas Truth table Venn diagram P ↑ Q P | Q P NAND Q P → ¬Q ¬P ← Q ¬P  ¬Q Dpq Q 0 1 P 0    1   1  1    1   0
Disjunction Notation Equivalent formulas Truth table Venn diagram P  Q P OR Q P  ¬Q ¬P → Q ¬P ↑ ¬Q ¬(¬P  ¬Q) Apq Q 0 1 P 0    0   1  1    1   1	Joint denial Notation Equivalent formulas Truth table Venn diagram P ↓ Q P NOR Q P  ¬Q ¬P  Q ¬P  ¬Q Xpq Q 0 1 P 0    1   0  1    0   0
Material nonimplication Notation Equivalent formulas Truth table Venn diagram P  Q P  Q P  ¬Q ¬P ↓ Q ¬P  ¬Q Lpq Q 0 1 P 0    0   0  1    1   0	Material implication Notation Equivalent formulas Truth table Venn diagram P → Q P  Q P ↑ ¬Q ¬P  Q ¬P ← ¬Q Cpq Q 0 1 P 0    1   1  1    0   1
Converse nonimplication Notation Equivalent formulas Truth table Venn diagram P  Q P  Q P ↓ ¬Q ¬P  Q ¬P  ¬Q Mpq Q 0 1 P 0    0   1  1    0   0	Converse implication Notation Equivalent formulas Truth table Venn diagram P  Q P  Q P  ¬Q ¬P ↑ Q ¬P → ¬Q Bpq Q 0 1 P 0    1   0  1    1   1
Exclusive disjunction Notation Equivalent formulas Truth table Venn diagram P  Q P  Q P  Q P XOR Q P  ¬Q ¬P  Q ¬P  ¬Q Jpq Q 0 1 P 0    0   1  1    1   0	Biconditional Notation Equivalent formulas Truth table Venn diagram P  Q P ≡ Q P XNOR Q P IFF Q P  ¬Q ¬P  Q ¬P  ¬Q Epq Q 0 1 P 0    1   0  1    0   1