1 / 9

Chapter 6 Quantified Truth Trees

Chapter 6 Quantified Truth Trees. 6.1 and 6.2: truth tree => NDL Practically useful 6.3: Models or interpretations => Slate Theoretically Important 6.4: From truth trees to interpretations Meta-theoretically Interesting. 6.1 Rule for Quantifiers.

whitney-golden
Download Presentation

Chapter 6 Quantified Truth Trees

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 6Quantified Truth Trees • 6.1 and 6.2: truth tree => NDL Practically useful • 6.3: Models or interpretations => Slate TheoreticallyImportant • 6.4: From truth trees to interpretations Meta-theoretically Interesting

  2. 6.1 Rule for Quantifiers • Church: undecidability, meaning no deterministic mechanics or procedures in checking of validity • Could result in an infinitely long tree • All the rules for sentential truth trees apply.

  3. 6.1.1 Instances • A(c) is an instance of either uA(u) or uA(u) if u is replaced by c uniformly. • uA(u) and uA(u) can be called generalizations of A(c), so to speak. • The quantifier to be eliminated must be the main connective (or negated main connective). • Non-conservative / conservative distinction

  4. Examples • xF(x) Fa • y(Fy→Gb) Fb→Gb (nonconservative) • xyFxy yFay • xy(zFzx↔wFwy) y(zFzc↔wFwy)

  5. Not Instances • xFx Fz Why: z is not a constant but a variable • yFy → Gb Fb → Gb Why: y is not the main connective • xy(Fxy → Fyx) y(Fcy → Fyx) Why: Not a uniform substitution of x by c • x(Fx & yGxy)Fa & yGby Why: a and b are different constants

  6. Rules that Require New Constants:E and ¬U: Checked • Existential (E) ۷uA(u), ۷(check / patch) A(c), must be conservative • Negated Universal (¬U) ۷¬uA(u) ¬A(c), must be conservative

  7. Rules: U and ¬ENonconservative • Universal (U) * uA(u), * dispatch mark A(c), Nonconservative • Negated Existential (¬E) *¬uA(u) ¬A(c), Nonconservative

  8. 6.2 Strategies • Close branches ASAP • Avoid splitting truth trees ALAP • Apply E or ¬U before U or ¬E, i.e., Conservatives before nonconservatives. • Don’t introduce new constants unless you must.

  9. Examples • Go through examples on the blackboard.

More Related