Show that is not finitely axiomatizable.Suggestion. Show that no finite subset of suffices, and then apply Section 2.6.

Necessary definitions can be found here.

==============================

Any hint to start this problem?

Printable View

- December 2nd 2011, 01:36 AMlogicsEnderton 3.1 Problem 6 (p. 193)
Show that is not finitely axiomatizable.

*Suggestion*. Show that no finite subset of suffices, and then apply Section 2.6.

Necessary definitions can be found here.

==============================

Any hint to start this problem? - December 2nd 2011, 08:26 AMAnnatalaRe: Enderton 3.1 Problem 6 (p. 193)
This is pretty straightforward. If you have a finite subset of the axioms, then you only have a finite number of versions of S4. Think of what might model that subset of axioms and what that implies.

- December 2nd 2011, 01:22 PMemakarovRe: Enderton 3.1 Problem 6 (p. 193)
- December 2nd 2011, 03:55 PMAnnatalaRe: Enderton 3.1 Problem 6 (p. 193)
Section 2.6 covers the basics of model theory and the cardinality of basic models (Lowenheim-Skolem, Los(Wash)-Vaught, etc.).

The result you want follows from Th 26H, I believe: If the consequences of some set are finitely axiomatizable, then there is a finite subset with the same consequences. So you need only to show that no finite subset of the consequences of As gives you the same consequences as As. I guess I would show it by showing that each of the single axioms must be in it in order to give you the same consequences, and any finite subset of the schema S4 gives you different consequences from all of S4.

Take this with a grain of salt though since I'm currently studying model theory myself (not for a class). - December 3rd 2011, 02:16 AMlogicsRe: Enderton 3.1 Problem 6 (p. 193)
- December 3rd 2011, 11:21 AMemakarovRe: Enderton 3.1 Problem 6 (p. 193)
- December 3rd 2011, 01:12 PMAnnatalaRe: Enderton 3.1 Problem 6 (p. 193)