a3notes - is smaller at the rst position they dier. Compare...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Math 486 Homework 3 Notes Paul Shafer pshafer@math.cornell.edu February 19, 2008 Everyone did well this week. I only have a few minor points. Problem I.5.1 Most of you handled each case by writing, for example, “if V ( α β ) = T then V ( α ) = T or V ( β ) = T ”. You should also say why this answers the question by writing something like “and each case provides a path through the corresponding atomic tableau”. Problem I.6.1 The book should do a better job of explaining the order it is using when choosing the next en- try to reduce in the CST construction. When generating τ m +1 from τ m , we choose the length- lexicographically least entry which is not reduced on some noncontradictory path. Recall the lex- icographic ordering on strings of length n : σ < L τ if and only if σ ( i ) < τ ( i ) where i is the first position at which σ and τ differ. The length-lexicographic order < LL on 2 is defined as follows: σ < LL τ ⇔ | σ | < | τ | ∨ ( | σ | = | τ | ∧ σ < L τ ) . That is, σ < LL τ if and only if σ is shorter than τ or σ and τ are the same length and
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: is smaller at the rst position they dier. Compare this to the lexicographic ordering < L extended to all of 2 < , which is dened by < L if and only if or is less than at the rst position they dier. For example 1 < LL 01 but 01 < L 1. It is easy to check that < LL well orders 2 < . However, < L is not a well order. For example, the set { n 1 | n N } 2 < has no < L-least element. The denition of a nished tableau from a set of premises requires that T must appear on every noncontradictory path through for every in . Technically you also check the CST has this property. The check is simple. Every noncontradictory path in extends some noncontradictory path in m , the tableau we had at stage m , and at stage m we added T m to the end of each such path when we form m +1 . 1...
View Full Document

This homework help was uploaded on 02/23/2008 for the course MATH 4860 taught by Professor Dorais during the Spring '08 term at Cornell University (Engineering School).

Ask a homework question - tutors are online