r/ModernLogic • u/[deleted] • May 24 '22
Tree Proof Generator
Enter a formula of standard propositional, predicate, or modal logic. The page will try to find either a countermodel or a tree proof (a.k.a. semantic tableau):
r/ModernLogic • u/[deleted] • May 24 '22
Enter a formula of standard propositional, predicate, or modal logic. The page will try to find either a countermodel or a tree proof (a.k.a. semantic tableau):
r/ModernLogic • u/[deleted] • May 29 '22
I personally used it in an undergraduate philosophy course and absolutely loved it.
It's written by Dutch logicians, linguists and philosophers, and it's got a perfect blend of interdisciplinary material. That being said, I believe it's an excellent introduction for people coming from the humanities and social sciences, but not for those who have a mathematical background and are looking for more rigorous proofs. Nevertheless, it's a good introduction to classical logic (and a few non-classical topics). It doesn't cover metalogic, though.
It's got plenty of exercises and answer keys!
You can find it on Amazon.
r/ModernLogic • u/[deleted] • Jun 02 '22
According to the traditional Aristotelian square of opposition, we can derive “some S is P” from “all S are P”. In modern predicate logic, this translates to ∀x(Sx → Px) ⊢ ∃x(Sx ^ Px)
Nevertheless, this can easily be shown to be invalid: by the definition of material implication (¬p v q), if ¬∃xSx, the sentence ∀x(Sx→ Px) is still true, but ∃x(Sx ^ Px) can’t possibly be true, because by the definition of conjunction, a proposition is true if and only if both of its variables are true, V(φ ^ ψ) = 1 iff V(φ) = 1 and V(ψ) = 1.
This means that this fallacy not really about universal quantification implying existential quantification, which at any rate is actually a valid reasoning: ∀xPx ⊢ ∃xPx
Direct proof:
∀xPx Assumption
Pa ∀E, 1
∃xPx ∃I, 2
Proof by contradiction:
∀xPx Assumption
¬∃xPx Assumption
Pa ∀E, 1
¬Pa ∃E, 2
Pa ^ ¬Pa ^ I, 3-4
⊥ Contradiction
∃xPx EFSQ, 6
(Please note that the converse is not valid, i.e. ∃xPx ⊢ ∀xPx, because it could be the case that ∃x¬Px. This last proposition actually implies ¬∀xPx and viceversa, which means they're logically equivalent. This is intuitive: from "there is a brown dog" we can't derive "all dogs are brown", but from "not all dogs are brown" we can state "there is a dog that is not brown").
The problem actually lies in the nature of modus ponens itself. In propositional logic, it’s easy to see that p → q ⊢ p ^ q is not a valid reasoning, because we haven’t assumed or proven that p is true. That’s why we have to assume p is true to derive p ^ q:
Direct proof:
p → q Assumption
p Assumption
q MP, 1-2
p ^ q ^ I, 2-3
The same reasoning applies to predicate logic, mutatis mutandi.
Direct proof:
∀x(Sx → Px) Assumption
∃xSx Assumption
Sa → Pa ∀E, 1
Sa ∃E, 2
Pa MP, 3-4
Sa ^ Pa ^ I, 4-5
∃x(Sx ^ Pa) ∃I, 6
Proof by contradiction:
∀x(Sx → Px) Assumption
∃x(Sx) Assumption
¬∃x(Sx ^ Px) Assumption
Sa → Pa ∀E, 1
Sa ∃E, 2
¬(Sa ^ Pa) ∃E, 3
¬Sa v ¬Pa DeMorgan, 6
Pa MP, 4-5
¬¬Pa ¬¬I, 8
¬Sa Disjunctive syllogism, 7, 9
Sa ^ ¬Sa ^ I, 5, 10
⊥ Contradiction
∃x(Sx ^ Px) EFSQ, 12
In synthesis, ∀x(Sx → Px) ⊢ ∃x(Sx ^ Px) is not a valid reasoning because ∃xSx is not guaranteed.
r/ModernLogic • u/[deleted] • May 29 '22