- #1
Mr.Cauliflower
- 18
- 0
Could someone please help me with the proof of the following statement?
Let L be language with n different constants and at least one predicate symbol. Prove that there exist 2 different maximal consistent sets formed of closed formulas of the language L.
Let L be language with n different constants and at least one predicate symbol. Prove that there exist 2 different maximal consistent sets formed of closed formulas of the language L.