Question: Let G be a set defined as follows: if z is a propositional variable, then z G: if f1, f2 G, then f G.
Let G be a set defined as follows: if z is a propositional variable, then z G: if f1, f2 G, then f G. (fi V f2) G. and (f ^ f2) = G; nothing else belongs to G. Use structural induction to prove that for every f G, there exists f' G such that f and f' are logically equivalent, and f' does not contain a symbol. (Recall that propositional formulas fi and f2 are logically equivalent if fi and f2 evaluate to the same value, no matter how their variables are set.)
Step by Step Solution
3.43 Rating (166 Votes )
There are 3 Steps involved in it
2 3 a propoxional variable done Now f f2 G 71 G fi V f E G fi Af 7 7 f V 7 f x Jo is 1 1 fv 7f ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
635daca76cf4f_177887.pdf
180 KBs PDF File
635daca76cf4f_177887.docx
120 KBs Word File
