Logic and Meaning Exam Style Questions Test the following sequents for validity by the method of semantic trees. If the sequent is invalid, specify a counterexample. (a) (∀x)(Fx → Gx) , (∀x)(Gx → Hx) ├ (∀x)(Fx → Hx) (b) (∃x)(Fx & (∃y)(Gy & Rxy)) ├ (∃x)(∃y)Rxy
Enter the password to open this PDF file:
-
-
-
-
-
-
-
-
-
-
-
-