A sentential connective is truth-functional iff the

Truth-tables truth-value of any compound sentence generated by

the connective is a function of the truth-value(s) of
Truth-functional Symbols the component sentence(s), or alternatively, iff the
connective can be defined in terms of a truth table.
Negation " ¬
Conjunction & . # Characteristic truth-table definitions:
Disjunction v P ~P
Material Conditional $ ! T F
F T
Material Biconditional % &
PQ P&Q PvQ P$Q P%Q
TT T T T T
TF F T F F
F T F T T F
F F F F T T

1 2

Truth-Functional vs. Non-Truth-Functional Connectives Truth-Functional vs. Non-Truth-Functional Connectives

Unary Connectives Binary Connectives

• Given that P is false: • Given that P and Q are both true:

o What is the truth-value of it is not the case that P o What is the truth-value of P and Q
(that is, ~ P)? (P & Q)?
o What is the truth-value of it is possible that P o What is the truth-value of P before Q
(that is, ! P)? (P < Q)?
• Suppose ‘P’ stands for ‘Jan is a woman.’ • Suppose ‘P’ stands for ‘Leibniz was born’ and
‘Q’ stands for ‘Locke was born.’
P=F ~P=T
P, Q = T P&Q=T
!P=T
P<Q=F
• Suppose ‘P’ stands for ‘Jan is a round-square.’
Q<T=T
P=F ~P=T
• Thus, ‘before’ is not truth-functional.
!P=F
• Thus, ‘it is possible that’ is not truth-functional.

3 4
Truth-table Tests: Three Things to Know:
1. Properties of Sentences: 1. Characteristic Truth-table
Truth-functional Truth, Falsity, Definitions
and Indeterminacy
2. How to Set-up Truth-tables;
2. Properties of Theories:
Grammar of SL Sentences
Truth-functional Consistency
and Inconsistency 3. How to Determine Whether a
3. Properties of Arguments: Property/Relation Holds
Truth-functional Validity
and Invalidity
4. Relations Between Sentences:
Truth-functional Equivalence
and Non-equivalence

5 6

Grammar of SL Sentences How to Determine a Property/Relation Holds

1. Consider these four sentences: For each property, look at the truth-values
under the main connective of the sentence.
~[(A v B) $ C]
1. Properties of Sentences:
~(A v B) $ C o A sentence is truth-functionally
(~A v B) $ C true iff it is true under every truth-
value assignment (in every row).
~A v (B $ C)
o A sentence is truth-functionally
2. The order for determining truth-values false iff it is false under every truth-
for the above sentences is 0, 1, 2, etc. value assignment (in every row).
3 0 10 2 0 o A sentence is truth-functionally
~ [(A v B) $ C] Main connective: ‘~’ indeterminate iff it is neither
truth-functionally true nor false.
2 01 0 3 0
~ (A v B) $ C Main connective: ‘$’ Look under the sentence’s main connective:
102 0 3 0 All T’s ' Truth-functionally True
(~A v B) $ C Main connective: ‘$’ All F’s ' Truth-functionally False
Mixed ' INDETERMINATE
1 02 01 0
~ A v (B $ C) Main connective: ‘v’

7 8
For each property, look at the truth-values
under the main connective of the sentences.
2. Properties of Theories:
o A theory is consistent iff every
member of the set is true under at
least one truth-value assignment.
o A theory is inconsistent iff it is not
consistent.
For each property, look at the truth-values
under the main connective of the sentences.
3. Properties of Arguments:
o An argument is invalid iff there is
at least one truth-value assignment
(row) where the premises are true
and the conclusion is false.
o An argument is valid iff it is not invalid.

Look under the main connective of each
sentence in the theory:
o One Row All True ' CONSISTENT
o No Row All True ' INCONSISTENT
Look under the main connective of each
premise and the conclusion:
o True Premises, False Conclusion
' INVALID
o Otherwise ' VALID

9 10

For each relation, look at the truth-values Examples

under the main connective of the sentences. o Truth-functionally true, false, indeterminate
4. Relations Between Sentences: ~P v P ~P & P ~(P v P) ~(P v ~P)
o Two statements are truth- ~A $ (B $ A) ~(A $ (B $ A))
functionally equivalent iff they ~(A $ B) $ A (~A $ B) $ A
have the same truth-value under
o Consistent, inconsistent
every truth-value assignment.
{A % B, A v B, ~(A & B)} {P $ Q, ~ Q, P}
o Two statements are truth- {P $ Q, Q, ~ P} {~ A, B, A % ~ B}
functionally non-equivalent iff they
are not truth-functionally equivalent. o Valid, invalid
P$Q P$Q P$Q P$Q
P Q ~P ~Q
Compare the truth-values under the main
Q P ~Q ~P
connective of each of the two sentences:
o Same at each row ' EQUIVALENT PvQ PvQ P%Q P$Q
o Otherwise ' NON-EQUIVALENT ~P P PvQ Q$R
Q ~Q P&Q P$R

o Equivalent, non-equivalent (two at a time only)

AvA A$A A&A A
~ (A v B) ~Av~B ~ (A & B) ~ A & ~ B
~AvB A$B B$A ~B$~A
A$A ~ (B & ~ B) ~ (A $ A) B & ~ B

11 12