Question: QUESTION from Logic and Computation course: Consider a first order language having an individual symbol, a, a unary function symbol, f, and a unary relation
QUESTION from Logic and Computation course:
Consider a first order language having an individual symbol, a, a unary function symbol, f, and a unary relation symbol, F. Let = {x(F(x) F(f(x)))}.
(a) Prove rigourously that resolution on the set can continue forever, always producing new formulas
b) Give a valuation, v, which satisfies , and explain why your choice of v is correct.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
