Let and be theories (in the same language) such that
(ii) is complete, and
(iii) is satisfiable. Show that .
Before I get started, I need to understand some definitions related to this problem.
(*) A theory T is said to be complete iff for every sentence , either or .
I am confused with an unsatisfiable theory, where a theory is defined to be a set of sentences closed under logical implication.
The textbook gives an example of an unsatisfiable theory, which is the theory consisting of all sentences of the language. Why is this unsatisfiable theory? Any description or example?