Truth Trees Flashcards

1
Q

what is decomposing

A

breaking down statements into substatements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is possible if the truth value of a statement is known

A

the statement can be broken down into to sub-statements and their truth values can also be known

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

what is the difference between single and double branching statements

A

single branching statements lead from one true statement directly to the next true statement

double branching statements lead in two possible outcomes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what are the three single branching statements and their decompositions

A

x&y x y

~(xvy) ~x ~y

~(x→y) x ~y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what are the two double branching statements with two decomposed sub-statements

A

x<->y x y or ~x ~y

~(x<->y) x ~y or ~x y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what are the 3 double branching to single sub-statements statements

A

~(x&y) ~x ~y

xvy x y

x→y ~x y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

steps for solving problems with truth trees

A
  1. set the problem to be solved as the trunk of the tree
  2. use the rules for the 8 basic SL statements to draw the branches
  3. if at least one branch is left open then one interpretation makes the statement true

if no branches are left open no single interpretation makes the statement true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly