2250 Lecture Notes - Mathematical Induction, Atomic Sentence, Glossary Of Video Game Terms

178 views8 pages

Document Summary

T"s and f"s do not appear on trees (unless, of course, they are there as sentence letters ra- ther than as truth value assignments). It is therefore a serious question whether the results ob- tained on the truth table will be reflected by trees in all cases. These two questions concern the soundness and the completeness of the tree method respec- tively. Soundness: if the tree method tells us that a set is t-f inconsistent, then that set really is t-f inconsistent. Completeness: if a set is t-f inconsistent, the tree method will tell us that it is. The tree test might not pick out all the t-f inconsis- tent sets, even though any sets that it does pick out are t-f inconsistent. In that case, it would be sound but not complete. Or it might not only pick out all the t-f inconsistent sets, but also some t-f consistent ones.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related textbook solutions

Related Documents