Question 1

Since there are open branches, it tells us that the formula is satisfiable and thus is not a
contradiction.
Question 2

i(p) = 1, i(q) = 0, i(r) = 1, i(s) = 1

i(p) = 0, i(q) = 1, i(r) = 0, i(s) = 0
i(p) = 0, i(q) = 1, i(r) = 1, i(s) = 0
i(p) = 0, i(q) = 0, i(r) = 0, i(s) = 0
i(p) = 0, i(q) = 0, i(r) = 1, i(s) = 1
i(p) = 1, i(q) = 1, i(r) = 0, i(s) = 1
i(p) = 1, i(q) = 1, i(r) = 1, i(s) = 1
i(p) = 1, i(q) = 0, i(r) = 0, i(s) = 0

In a tree, if a branch stays open, then there’s a way of assigning all the literals in the branch
such that they are all true (since for a branch to be open, a formula and its negation cannot
coexist in it) and these conjunct together to make the basis formulas. Due to the nature of
conjunction and how a basis formula is made, the basis formula is only true through the
assignment of literals implied by the open branch. In addition, a truth tree is known to be
complete in a sense that “truth flows up”. That is, if derived formulas are true, then the
parent/complex formulas which the derived formulas originate from are also true. We can verify
this with every possible rule in deconstructing a formula in a truth tree:

Handling some cases, if A and B both are true, then so is (A & B). If A is true or B is true (or
both), then for either case (A V B) will be true. If A is false (~A is true) or B is false (~B is true),
then either case, we know that both can’t be true, so therefore ~(A & B) is true. The same goes
for the rest of the formulas.

Thus, since an open branch has a way(s) of assigning all the literals in the branch such that
they are all true, making a basis formula(s), then due to “truth flowing up”, we know that the
parent/complex formulas in the branch are true as well for the model(s) (A model is an
interpretation that makes the formula true) which make the basis formulas. Thus we can
conclude that all the formulas in the open branch are at least true for every interpretation that
makes the basis formula true. Thus every formula in an open branch is entailed by the basis
formula.
Question 3

((p & ~q) & (r & s)) V (((~p & q) & (~r & ~s)) V (((~p & q) & (r & ~s)) V (((~p & ~q) & (~r & ~s))
V (((~p & ~q) & (r & s)) V (((p & q) & (~r & s)) V (((p & q) & (r & s)) V ((p & ~q) & (~r &
~s)))))))

We can show that the disjunction of the basis formulas is logically equivalent to the original
formula through writing out the truth table for the original formula and showing that any
interpretation that makes the original formula true is one of the group of conjuncts (basis
formula) in the disjunction of basis formulas, thus making the latter formula true as well. Then
we also note that any interpretation that doesn’t make the original formula true is also not one of
the group of conjuncts or basis formulas in the disjunction of basis formulas, making the latter
false.

From comparing each basis formula in the disjunction with the truth table, we see that for
each basis formula, there exists an equivalent assignment of literals satisfying the basis
formula such that it makes the original formula true (and vice versa).

This works because the disjunction of basis formulas is in disjunctive normal form, which means
that for the formula to be true, one of its group of conjuncts (in this case the basis formulas) has
to be true, following the nature of disjunction.

The disjunction of basis formulas represent the disjunction of each model for the original
formula. Therefore, if an interpretation is a model for the original formula, then it will satisfy a
basis formula and thus the disjunction of basis formulas and if it's not a model, then it won’t
satisfy the disjunction of basis formulas. Therefore the two formulas are logically equivalent
Question 4

Since each open branch represents a way(s) of assigning the literals such that the original
formula(s) is satisfied, forming the basis formulas, then the disjunction of the basis formulas
represent the disjunction of each possible assignment of values such that the original formula is
satisfied (This is known as the Disjunctive Normal Form). To satisfy this disjunction of basis
formulas, any one of the basis formulas needs to be satisfied. Thus if an interpretation is a
model for the disjunction of the basis formulas, then that interpretation must be a basis formula
and one of the possible assignment of values that satisfy the original formula. On the other
hand, if an interpretation does not make the disjunction of basis formulas true, then it is not one
of the assignments of values belonging to an open branch in the truth tree and thus equivalently
does not make the original formula true.

Therefore, the disjunction of basis formulas is logically equivalent to the original formula.