2250 Lecture Notes - Atomic Sentence, Propositional Calculus
5 Feb 2013
School
Department
Course
Professor
Document Summary
The decidability of the tree method for sl. The tree method is a decision procedure for sentential logic. It is supposed to tell us whether or not a set of sentences of sl is truth functionally consistent. I have claimed that if a set is t-f inconsistent the tree for that set will always close. Proving that the tree method is good in the second of these ways (if the tree is closed the set is always t-f inconsistent) is referred to as proving that the tree method is sound. If the tree method tells us that a set is t-f inconsistent, it really is t-f inconsistent. Proving that the tree method is good in the last of these ways (if the set is t-f inconsistent the tree is always closed) is referred to as proving that the tree method is complete. All the t-f inconsistent sets that there are to be found get found by the tree method.
