Logic is not my forte. So prepare for a load of posts in which Matt tries to get to grips with stuff rather than declaring war on people I disagree with.

~~~

I suppose there's no particular reason not to kick off with the laws of thought, those three sexy rules that define for all and sundry what are valid inferences and what are not. Despite their name they are not about though per se, but logic. We're safe on that front.

- Law of identity :
**F(x) ⊃ F(x)** - Law of non-contradiction :
**∼(p · ∼p)** - Law of excluded middle :
**p ∨ ∼p**

Britannica also mentions some exceptions re the excluded middle;

The law of excluded middle and certain related laws have been rejected by L.E.J. Brouwer, a Dutch mathematical intuitionist, and his school, who do not admit their use in mathematical proofs in which all members of an infinite class are involved. Brouwer would not accept, for example, the disjunction that either there occur ten successive 7’s somewhere in the decimal expansion of Ï€ or else not, since no proof is known of either alternative; but he would accept it if applied, for instance, to the first 10100 digits of the decimal, since these could in principle actually be computed.

James Danaher writes to terrific effect on the subject while also getting to grips with lots of the criticisms that various philosophers have raised about the applicability of these laws in certain contexts.

~~~

A quick key/legend is going to be needed here;

A B C are the Constants, so they are defined within some particular atomic proposition.

P Q R are the Variables, so they range across all atomic propositions within whatever greater proposition the budding logician is building.

Ï† Ïˆ Ï‡

*are the Schematic Letters, so they range over all propositions ever!*

See the trend outwards from ABC to Ï†ÏˆÏ‡?

¬ means Negation or Denial, so that '¬P' means 'not P'.

∧ means Conjunction, so that 'P ∧ Q' means 'P and Q'. This leaves four combos where one or both are true, namely;

P is true and Q is true : P Q

P is true and Q is false : P ¬Q

P is false and Q is true : ¬P Q

P is false and Q is false : ¬P ¬Q

∨ means Disjunction, so that 'P ∨ Q' means 'P or Q'.

→ means Conditional, so that 'P → Q' means 'if P then Q'.

↔ means Biconditional, 'P ↔ Q' means 'P if and only if Q'.

In an act of shameless theft from Wikipedia I give you the...

... basic and Derived Argument Forms | ||
---|---|---|

Name | Sequent | Description |

Modus Ponens | If p then q; p; therefore q | |

Modus Tollens | If p then q; not q; therefore not p | |

Hypothetical Syllogism | If p then q; if q then r; therefore, if p then r | |

Disjunctive Syllogism | Either p or q, or both; not p; therefore, q | |

Constructive Dilemma | If p then q; and if r then s; but p or r; therefore q or s | |

Destructive Dilemma | If p then q; and if r then s; but not q or not s; therefore not p or not r | |

Bidirectional Dilemma | If p then q; and if r then s; but p or not s; therefore q or not r | |

Simplification | p and q are true; therefore p is true | |

Conjunction | p and q are true separately; therefore they are true conjointly | |

Addition | p is true; therefore the disjunction (p or q) is true | |

Composition | If p then q; and if p then r; therefore if p is true then q and r are true | |

De Morgan's Theorem (1) | The negation of (p and q) is equiv. to (not p or not q) | |

De Morgan's Theorem (2) | The negation of (p or q) is equiv. to (not p and not q) | |

Commutation (1) | (p or q) is equiv. to (q or p) | |

Commutation (2) | (p and q) is equiv. to (q and p) | |

Commutation (3) | (p is equiv. to q) is equiv. to (q is equiv. to p) | |

Association (1) | p or (q or r) is equiv. to (p or q) or r | |

Association (2) | p and (q and r) is equiv. to (p and q) and r | |

Distribution (1) | p and (q or r) is equiv. to (p and q) or (p and r) | |

Distribution (2) | p or (q and r) is equiv. to (p or q) and (p or r) | |

Double Negation | p is equivalent to the negation of not p | |

Transposition | If p then q is equiv. to if not q then not p | |

Material Implication | If p then q is equiv. to not p or q | |

Material Equivalence (1) | (p iff q) is equiv. to (if p is true then q is true) and (if q is true then p is true) | |

Material Equivalence (2) | (p iff q) is equiv. to either (p and q are true) or (both p and q are false) | |

Material Equivalence (3) | (p iff q) is equiv to., both (p or not q is true) and (not p or q is true) | |

Exportation^{[9]} |
from (if p and q are true then r is true) we can prove (if q is true then r is true, if p is true) | |

Importation | If p then (if q then r) is equivalent to if p and q then r | |

Tautology (1) | p is true is equiv. to p is true or p is true | |

Tautology (2) | p is true is equiv. to p is true and p is true | |

Tertium non datur (Law of Excluded Middle) | p or not p is true | |

Law of Non-Contradiction | p and not p is false, is a true statement |

Is A actually A? Well, using calculus you can do a chain of derivations - five of the suckers, referring to every step AFTER the premises - to sufficiently demonstrate the case, as below;

Number | Formula | Reason |
---|---|---|

1 | premise | |

2 | From (1) by disjunction introduction | |

3 | From (1) and (2) by conjunction introduction | |

4 | From (3) by conjunction elimination | |

5 | Summary of (1) through (4) | |

6 | From (5) by conditional proof |

That symbol that looks like a T knocked 90° anti-clockwise ( ⊢ ) means 'entails' or 'leads to' which is super useful;

can be then be read

I know is true".^{[3] }

^{}In the same vein, a conditional assertion

can be read as:

From , I know that

~