Question: 7. (10+10 points) (a) We say that a set I of formulas in a language L is complete if it is consistent and for

![(b) Prove (3.4.10) that for all I c S(P) and 4,0 ? S(P), if TF4, then I + $[@/x] provided propositional variable x does not o](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2022/08/6308cfdb7a865_8836308cfdb41cc0.jpg)
7. (10+10 points) (a) We say that a set I of formulas in a language L is complete if it is consistent and for each formula in L, exactly one of y and is in I. Show that if I is complete, then it is maximal consistent (i.e. every set properly containing I is inconsistent). (b) Prove (3.4.10) that for all I c S(P) and 4,0 S(P), if ry, then ry[0/x] provided propositional variable x does not occur in formulas of I used in derivation of rty.
Step by Step Solution
3.41 Rating (154 Votes )
There are 3 Steps involved in it
To address the given problem lets break it down into parts a and b Part a Task Show that if Gamma is complete then it is maximal consistent Definition... View full answer
Get step-by-step solutions from verified subject matter experts
