creating an infinite model
From the syntactic compactness theorem for first order logic, we get this nice (and useful) result:
Let T be a theory of first-order logic. If T has finite models of unboundedly large sizes, then T also has an infinite model.
Proof.
Define the propositions
Φn≡∃x1⋯∃xn.(x1≠x2)∧⋯∧(x1≠xn)∧(x2≠x3)∧⋯∧(xn-1≠xn)¯ |
(Φn says “there exist (at least) n different elements in the world”). Note that
⋯⊢Φn⊢⋯⊢Φ2⊢Φ1. |
Define a new theory
𝐓∞=𝐓∪{Φ1,Φ2,…}. |
For any finite subset 𝐓′⊂𝐓∞, we claim that 𝐓′ is consistent: Indeed, 𝐓′ contains axioms of T, along with finitely many of {Φn}n≥1. Let Φm correspond to the largest index appearing in 𝐓′. If ℳm⊧ is a model of T with at least elements (and by hypothesis, such as model exists), then .
So every finite subset of is consistent; by the compactness theorem for first-order logic, is consistent, and by Gödel’s completeness theorem for first-order logic it has a model . Then , so is a model of T with infinitely many elements ( for any , so has at least elements for all ). ∎
Title | creating an infinite model |
---|---|
Canonical name | CreatingAnInfiniteModel |
Date of creation | 2013-03-22 12:44:29 |
Last modified on | 2013-03-22 12:44:29 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 9 |
Author | CWoo (3771) |
Entry type | Example |
Classification | msc 03B10 |
Classification | msc 03C07 |
Related topic | CompactnessTheoremForFirstOrderLogic |
Related topic | GettingModelsIModelsConstructedFromConstants |