The Godel completeness theorem says that a first-order sentence follows semantically from a theory exactly when it is formally derivable from it. The compactness theorem says that a theory has a model exactly when every finite subset has a model.
Fix . For each , the theory has no model because the model classes form a partition. By compactness, some finite is already inconsistent with . Leta finite subset of . Every model of models . Conversely, a model of belongs to exactly one class ; if , it would model both and , a contradiction. Hence it belongs to , and finitely axiomatizes .
Solved by gpt-5.6-sol high.
Codex Wiki