![]() ![]() By a simila similarr argumen argument, t, the number of left parenthesis, right parenthesis and connective symbols in (α ∧ β ), (α ∨ β ), (α → β ) and (α ↔ β ) are equal. lγ = lα + 3, rγ = rα + 3, cγ = cα + 3 = so lγ = rγ = cγ by the induction induction hypothesi hypothesis. Inducti Inductive ve step: step: Let γ = (¬α). Inducti Induction on hypothesi hypothesis: s: Let α and β be two wffs. Let l, r and c be, respecProof: We will use the inducti tively, the number of left parenthesis, right parenthesis and connective symbols in a wff. Lemma 1 The number of left parenthesis, right parenthesis and connective symbols are equal in a wff. The The Langu Language age of Senten Sententia tiall Logic Logic Do feel free to email me if you have any comments or to point out any errors (of which there will likely be plenty). It’d be great if this document helps anyone out in any form or fashion. I have posted it online as a possible resource for others also using the book. Its main purpose is to facilitate my own learning. Overview This document details my attempt to solve some of the problems in Herbert Enderton’s A Enderton’s A Mathematical Introduction to Logic (2nd Edition) . Some Solutions to Enderton’s Mathematical Introduction to Logic Kelvin Soh ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |