Hi y’all! So, if you’re computer science majors/philosophy major/etc., you probably have to take this class in college. I love this stuff because it’s very procedural and the proofs they give for you to solve are like puzzles and puzzles are super fun. Today, we’re gonna look at the 8 basic rules and then we’ll look at the replacement rules and more. I’m going to assume that y’all know the basic structure of sentential logic including operators and truth tables. Let’s get started.
A proof is a procedure which is supposed to derive the desired conclusion from a set of premises. To do this, the proof has to be set up in a certain way. First, all lines of a proof must be numbered. The premises make up the first lines of the proof along with the desired conclusion. Then, all subsequent derivations from the premises are listed below with the justification for each step listed along the right side, noting which rule was used and what lines of the proof were referenced. Here’s an example:
- Premise Pr. (for premise)
- Premise Pr. /:. Conclusion
- Derivation (Name of Rule) 1, 2 (lines 1 & 2 referenced)
For our purposes on this page, the visualisations for each of the rules below will not be written in this vertical fashion as they are cumbersome to format in the WordPress editor so it’ll be horizontal.
Let’s get into the rules and then work on some examples which will be on page 2.
1. Simplification (Simp.)
p • q /:. p
p • q /:. q
If there is a conjunction, then both conjuncts can be individually represented as being true by themselves.
2. Conjunction (Conj.)
p; q /:. p • q
If two variables are true, then they can be joined in a conjunction.
3. Addition (Add.)
p /:. p V q
This rule is incredibly powerful as it allows you to introduce new elements into a disjunction as long as we have one of its disjuncts as true.
4. Disjunctive Syllogism (D.S.)
p V q; ~q /:.p
p V q; ~p /:. q
If one of the disjuncts is stated to be false, then the remaining disjunct is true.
5. Modus Tollens (M.T)
p ⊃ q; ~q /:. ~p
If the consequent of a conditional is false, then its antecedent is also false.
6. Modus Ponens (M.P.)
p ⊃ q; p /:. q
If the antecedent of a conditional is true, then the consequent is also true.
7. Hypothetical Syllogism (H.S.)
p ⊃ q; q⊃ r /:. p ⊃ r
If the antecedent of a conditional leads to an antecedent of another conditional, then you can infer that the first antecedent leads to the consequent of the second conditional.
8. Rule of Dilemma/ Constructive Dilemma (C.D)
p V q; p⊃ s; q⊃ r /:. s V r
If either of the antecedents of two conditionals is true, then either of their consequents must also be true.
Alright, off to examples! We’re gonna start off easy and build onto harder and longer proofs.
Alright, now on to real problems; I have included two. I’ll give you guys the premises and the desired conclusion and I’ll post answers on how to derive the conclusion on the page after that. On to the next page!
Leave a Reply