Question: a ) We can draw Truth Trees for a single sentence as well as for an argument. Draw a truth tree for the sentence displayed

a) We can draw Truth Trees for a single sentence as well as for an
argument. Draw a truth tree for the sentence displayed below. ('S (y,x)' is
short for 'y is the successor of x' or 'y is one greater than x'').
AAxEEyS(y,x)
Whenever you get a new name in your proof,
instantiate the Universal Quantifier with that new name, and
continue the tree. Be careful. Make sure that the tree contains an
instance of every existential generalization. The tree should be peculiar. I don't
want the whole tree, 1 just want enough to see that you understand.
b) suppose you had an argument with a truth tree that looked peculiar in the
same way the tree for this sentence looks peculiar. Is the argument proved
(and valid) or not proved (and invalid)?
c) Suppose you gave an interpretation that made every sentence of your tree
true. Consider the Universe of discourse, also called the 'Domain' - all the
things the interpretation says exists. What can you say about it?
a ) We can draw Truth Trees for a single sentence

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!