This preview shows page 1. Sign up to view the full content.
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 < Lleast 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).
 Spring '08
 DORAIS
 Math, Logic

Click to edit the document details