Problem Set 9: GPLI Trees
PHIL1012 Introductory Logic
#708828360
1. Use a tree to test whether the following propositions are jointly satisfiable. If they are, then read a model off
the tree.
(a) (∃zb=z→ c=b), (∃xKxb∧(Jca∨Hca))
2. Use a tree to test whether the following argument is valid. If it is not, then read a countermodel off the tree.
(a) (Gbb∧a=c), ∃yGcy ∴ ((¬Gab↔ (a=c∧c=a))→ ¬∃y∀zy=z)
https://www.sydney.edu.au/students/academic-integrity.html