Compactness theorem: Difference between revisions

Revision as of 05:58, 28 November 2002

Revision as of 05:59, 28 November 2002

Line 1:

In [[mathematical logic]], the '''Compactness theorem''' asserts that a set of sentences is [[consistency|consistent]] if and only if any finite [[subset]] of it is consistent. Any consistent set of sentences in logic has a [[model]], so this is equivalent to saying that set of sentences has a model if and only if any finite subset of it has a model.

This is a basic fact in logic and [[model theory]], and has very far reaching consequences. For instance, it follows that if some sentence can be true
for [[field]]s of arbitrary large [[characteristic]], it must also be true for some field of [[characteristic]] zero. In other words, if some sentence holds for every [[field]] of [[characteristic]] zero it must hold for every field of [[characteristic]] larger than some constant -this application is called '''Robertson's principle'''