Logic1123 - Completeness for firsts order logic 1. 2. 3....

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Reading for the next week Ch.20 (skip Ch.19) HW #9 (due Monday, 11/30) 1. By applying a procedure similar to the propositional case, show the correctness of the tableau method for first-order logic. 2. Construct a systematic tableau (as defined in the textbook) for T∀x∃yRxyI ∃x∀y~Rxy and show that it
Background image of page 2
A truth set S satisfies three condi- tions: T0. For every formula X, one and only one of TX or FX is in S. (a set satisfying T0 is called full ). Every truth set is a Hintikka set. If a set satisfies T0~ T2, the set satisfies H0~ H2.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A set S of signed formulas is consist- ent if all finite subsets of S are satis- fiable. Consistency is a compact property (by Theorem 16.9 ): a set is consistent iff every finite subset is consistent. By Theorem 16.8 , any consistent set S is a subset of a maximally consistent set. (two errors
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 12

Logic1123 - Completeness for firsts order logic 1. 2. 3....

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online