Question: FORMAL LOGIC Computer Science School of Computing 1.3 Show that the formula in Question 1.2 is a theorem of the Gentzen system G. Annotate the

FORMAL LOGIC

Computer Science School of Computing

FORMAL LOGIC Computer Science School of Computing 1.3 Show that the formula

1.3 Show that the formula in Question 1.2 is a theorem of the Gentzen system G. Annotate the lines of your proof with the rules used. (i) Define the satisfiability and unsatisfiability of a set of formulas. (ii) Consider the following theorem: If U=A then U{B}=A for any formula B. Say U is a satisfiable set of formulas, but B is an unsatisfiable formula. Will U{B} not then be an unsatisfiable set, and does this not show that the theorem is incorrect? Explain your answers, referring to the definitions of satisfiability and unsatisfiability of a formula and a set of formulas

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 Databases Questions!