W. D. Hamilton: Difference between revisions
en>Haeinous mNo edit summary |
|||
| Line 1: | Line 1: | ||
In [[mathematical logic]], the '''compactness theorem''' states that a set of [[first-order predicate calculus|first-order]] sentences has a [[model theory|model]] if and only if every finite [[subset]] of it has a model. This theorem is an important tool in [[model theory]], as it provides a useful method for constructing models of any set of sentences that is finitely [[consistency|consistent]]. | |||
The compactness theorem for the [[propositional calculus]] is a consequence of [[Tychonoff's theorem]] (which says that the product of [[compact space]]s is compact) applied to compact [[Stone space]]s;<ref>See Truss (1997).</ref> hence, the theorem's name. Likewise, it is analogous to the [[finite intersection property]] characterization of compactness in topological spaces: a collection of closed sets in a compact space has a non-empty intersection if every finite subcollection has a non-empty intersection. | |||
The compactness theorem is one of the two key properties, along with the downward [[Löwenheim–Skolem theorem]], that is used in [[Lindström's theorem]] to characterize first-order logic. Although there are some generalizations of the compactness theorem to non-first-order logics, the compactness theorem itself does not hold in them. | |||
==History== | |||
[[Kurt Gödel]] proved the countable compactness theorem in 1930. [[Anatoly Maltsev]] proved the uncountable case in 1936.<ref>[[Robert Lawson Vaught|Vaught, Robert L.]]: Alfred Tarski's work in model theory. J. Symbolic Logic 51 (1986), no. 4, 869–882</ref> | |||
<ref>[[Abraham Robinson|Robinson, A.]]: Non-standard analysis. North-Holland Publishing Co., Amsterdam 1966. page 48.</ref> | |||
== Applications == | |||
The compactness theorem has many applications in model theory; a few typical results are sketched here. | |||
The compactness theorem implies [[Robinson's principle]]: If a first-order sentence holds in every [[field (mathematics)|field]] of [[characteristic (algebra)|characteristic]] zero, then there exists a constant ''p'' such that the sentence holds for every field of characteristic larger than ''p''. This can be seen as follows: suppose φ is a sentence that holds in every field of characteristic zero. Then its negation ¬φ, together with the field axioms and the infinite sequence of sentences 1+1 ≠ 0, 1+1+1 ≠ 0, …, is not satisfiable (because there is no field of characteristic 0 in which ¬φ holds, and the infinite sequence of sentences ensures any model would be a field of characteristic 0). Therefore, there is a finite subset ''A'' of these sentences that is not satisfiable. We can assume that ''A'' contains ¬φ, the field axioms, and, for some ''k'', the first ''k'' sentences of the form 1+1+...+1 ≠ 0 (because adding more sentences doesn't change unsatisfiability). Let ''B'' contains all the sentences of ''A'' except ¬φ. Then any model of ''B'' is a field of characteristic greater than ''k'', and ¬φ together with ''B'' is not satisfiable. This means that φ must hold in every model of ''B'', which means precisely that φ holds in every field of characteristic greater than ''k''. | |||
A second application of the compactness theorem shows that any theory that has arbitrarily large finite models, or a single infinite model, has models of arbitrary large [[cardinality]] (this is the [[Upward Löwenheim–Skolem theorem]]). So, for instance, there are nonstandard models of [[Peano arithmetic]] with uncountably many 'natural numbers'. To achieve this, let ''T'' be the initial theory and let κ be any [[cardinal number]]. Add to the language of ''T'' one constant symbol for every element of κ. Then add to ''T'' a collection of sentences that say that the objects denoted by any two distinct constant symbols from the new collection are distinct (this is a collection of κ<sup>2</sup> sentences). Since every ''finite'' subset of this new theory is satisfiable by a sufficiently large finite model of ''T'', or by any infinite model, the entire extended theory is satisfiable. But any model of the extended theory has cardinality at least κ | |||
A third application of the compactness theorem is the construction of [[non-standard analysis|nonstandard models]] of the real numbers, that is, consistent extensions of the theory of the real numbers that contain "infinitesimal" numbers. To see this, let Σ be a first-order axiomatization of the theory of the real numbers. Consider the theory obtained by adding a new constant symbol ε to the language and adjoining to Σ the axiom ε > 0 and the axioms ε < 1/''n'' for all positive integers ''n''. Clearly, the standard real numbers '''R''' are a model for every finite subset of these axioms, because the real numbers satisfy everything in Σ and, by suitable choice of ε, can be made to satisfy any finite subset of the axioms about ε. By the compactness theorem, there is a model *'''R''' that satisfies Σ and also contains an infinitesimal element ε. A similar argument, adjoining axioms ω > 0, ω > 1, etc., shows that the existence of infinitely large integers cannot be ruled out by any axiomatization Σ of the reals.<ref name="Goldblatt">{{cite book |title=Lectures on the Hyperreals |last=Goldblatt |first=Robert |authorlink=Robert Goldblatt |year=1998 |publisher=[[Springer Verlag|Springer]] |location=New York |isbn=0-387-98464-X |pages=10–11 }}</ref> | |||
== Proofs == | |||
One can prove the compactness theorem using [[Gödel's completeness theorem]], which establishes that a set of sentences is satisfiable if and only if no contradiction can be proven from it. Since proofs are always finite and therefore involve only finitely many of the given sentences, the compactness theorem follows. In fact, the compactness theorem is equivalent to Gödel's completeness theorem, and both are equivalent to the [[Boolean prime ideal theorem]], a weak form of the [[axiom of choice]].<ref>See Hodges (1993).</ref> | |||
Gödel originally proved the compactness theorem in just this way, but later some "purely semantic" proofs of the compactness theorem were found, i.e., proofs that refer to ''truth'' but not to ''provability''. One of those proofs relies on [[ultraproduct]]s hinging on the axiom of choice as follows: | |||
Proof: Fix a first-order language L, and let Σ be a collection of L-sentences such that every finite subcollection of L-sentences, ''i'' ⊆ Σ of it has a model <math>\mathcal{M}_i</math>. Also let <math>\prod_{i \subseteq \Sigma}\mathcal{M}_i</math> be the direct product of the structures and ''I'' be the collection of finite subsets of Σ. For each ''i'' in ''I'' let | |||
A<sub>''i''</sub> := { ''j'' ∈ ''I'' : ''j'' ⊇ ''i''}. | |||
The family of all of these sets A<sub>''i''</sub> generates a proper [[Filter (mathematics)|filter]], so there is an [[ultrafilter]] ''U'' containing all sets of the form A<sub>''i''</sub>. | |||
Now for any formula φ in Σ we have: | |||
* the set A<sub>{φ}</sub> is in ''U'' | |||
* whenever ''j'' ∈ A<sub>{φ}</sub>, then φ ∈ ''j'', hence φ holds in <math>\mathcal M_j</math> | |||
* the set of all ''j'' with the property that φ holds in <math>\mathcal M_j</math> is a superset of A<sub>{φ}</sub>, hence also in ''U'' | |||
Using [[ultraproduct#Łoś's theorem|Łoś's theorem]] we see that φ holds in the [[ultraproduct]] <math>\prod_{i \subseteq \Sigma}\mathcal{M}_i/U</math>. So this ultraproduct satisfies all formulas in Σ. | |||
==See also== | |||
* [[List of Boolean algebra topics]] | |||
* [[Löwenheim-Skolem theorem]] | |||
* [[Herbrand's theorem]] | |||
* [[Barwise compactness theorem]] | |||
==Notes== | |||
{{Reflist}} | |||
==References== | |||
* {{cite book | last=Boolos | first=George | coauthors=Jeffrey, Richard; Burgess, John | title=''Computability and Logic'' | edition=fourth | year=2004 | publisher="Cambridge University Press }} | |||
* {{cite book | last=Chang | first=C.C. | coauthors=[[Howard Jerome Keisler|Keisler, H. Jerome]] | publisher=[[Elsevier]] | title=Model Theory | year=1989 | edition=third | isbn=0-7204-0692-7 }} | |||
* {{cite journal | last=Dawson | first=John W. junior | title=The compactness of first-order logic: From Gödel to Lindström | journal=History and Philosophy of Logic | year=1993 | volume=14 | pages=15–37 | doi=10.1080/01445349308837208 }} | |||
* {{cite book | last=Hodges | first=Wilfrid | authorlink=Wilfrid Hodges | publisher=[[Cambridge University Press]] | title=Model theory | year=1993 | isbn=0-521-30442-3 }} | |||
* {{cite book | last=Marker | first=David | title= Model Theory: An Introduction | publisher=Springer | year=2002 | isbn=0-387-98760-6| series=[[Graduate Texts in Mathematics]] 217}} | |||
* {{cite book | last=Truss | first=John K. | title=Foundations of Mathematical Analysis | year=1997 | publisher=[[Oxford University Press]] | isbn=0-19-853375-6 }} | |||
== Further reading == | |||
* {{cite book |author=Hummel, Christoph |title=Gromov's compactness theorem for pseudo-holomorphic curves |publisher=Birkhäuser |location=Basel, Switzerland |year=1997 |pages= |isbn=3-7643-5735-5 |oclc= |doi=}} | |||
[[Category:Model theory]] | |||
[[Category:Theorems in the foundations of mathematics]] | |||
[[Category:Metatheorems]] | |||
Revision as of 07:22, 9 December 2013
In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful method for constructing models of any set of sentences that is finitely consistent.
The compactness theorem for the propositional calculus is a consequence of Tychonoff's theorem (which says that the product of compact spaces is compact) applied to compact Stone spaces;[1] hence, the theorem's name. Likewise, it is analogous to the finite intersection property characterization of compactness in topological spaces: a collection of closed sets in a compact space has a non-empty intersection if every finite subcollection has a non-empty intersection.
The compactness theorem is one of the two key properties, along with the downward Löwenheim–Skolem theorem, that is used in Lindström's theorem to characterize first-order logic. Although there are some generalizations of the compactness theorem to non-first-order logics, the compactness theorem itself does not hold in them.
History
Kurt Gödel proved the countable compactness theorem in 1930. Anatoly Maltsev proved the uncountable case in 1936.[2] [3]
Applications
The compactness theorem has many applications in model theory; a few typical results are sketched here.
The compactness theorem implies Robinson's principle: If a first-order sentence holds in every field of characteristic zero, then there exists a constant p such that the sentence holds for every field of characteristic larger than p. This can be seen as follows: suppose φ is a sentence that holds in every field of characteristic zero. Then its negation ¬φ, together with the field axioms and the infinite sequence of sentences 1+1 ≠ 0, 1+1+1 ≠ 0, …, is not satisfiable (because there is no field of characteristic 0 in which ¬φ holds, and the infinite sequence of sentences ensures any model would be a field of characteristic 0). Therefore, there is a finite subset A of these sentences that is not satisfiable. We can assume that A contains ¬φ, the field axioms, and, for some k, the first k sentences of the form 1+1+...+1 ≠ 0 (because adding more sentences doesn't change unsatisfiability). Let B contains all the sentences of A except ¬φ. Then any model of B is a field of characteristic greater than k, and ¬φ together with B is not satisfiable. This means that φ must hold in every model of B, which means precisely that φ holds in every field of characteristic greater than k.
A second application of the compactness theorem shows that any theory that has arbitrarily large finite models, or a single infinite model, has models of arbitrary large cardinality (this is the Upward Löwenheim–Skolem theorem). So, for instance, there are nonstandard models of Peano arithmetic with uncountably many 'natural numbers'. To achieve this, let T be the initial theory and let κ be any cardinal number. Add to the language of T one constant symbol for every element of κ. Then add to T a collection of sentences that say that the objects denoted by any two distinct constant symbols from the new collection are distinct (this is a collection of κ2 sentences). Since every finite subset of this new theory is satisfiable by a sufficiently large finite model of T, or by any infinite model, the entire extended theory is satisfiable. But any model of the extended theory has cardinality at least κ
A third application of the compactness theorem is the construction of nonstandard models of the real numbers, that is, consistent extensions of the theory of the real numbers that contain "infinitesimal" numbers. To see this, let Σ be a first-order axiomatization of the theory of the real numbers. Consider the theory obtained by adding a new constant symbol ε to the language and adjoining to Σ the axiom ε > 0 and the axioms ε < 1/n for all positive integers n. Clearly, the standard real numbers R are a model for every finite subset of these axioms, because the real numbers satisfy everything in Σ and, by suitable choice of ε, can be made to satisfy any finite subset of the axioms about ε. By the compactness theorem, there is a model *R that satisfies Σ and also contains an infinitesimal element ε. A similar argument, adjoining axioms ω > 0, ω > 1, etc., shows that the existence of infinitely large integers cannot be ruled out by any axiomatization Σ of the reals.[4]
Proofs
One can prove the compactness theorem using Gödel's completeness theorem, which establishes that a set of sentences is satisfiable if and only if no contradiction can be proven from it. Since proofs are always finite and therefore involve only finitely many of the given sentences, the compactness theorem follows. In fact, the compactness theorem is equivalent to Gödel's completeness theorem, and both are equivalent to the Boolean prime ideal theorem, a weak form of the axiom of choice.[5]
Gödel originally proved the compactness theorem in just this way, but later some "purely semantic" proofs of the compactness theorem were found, i.e., proofs that refer to truth but not to provability. One of those proofs relies on ultraproducts hinging on the axiom of choice as follows:
Proof: Fix a first-order language L, and let Σ be a collection of L-sentences such that every finite subcollection of L-sentences, i ⊆ Σ of it has a model . Also let be the direct product of the structures and I be the collection of finite subsets of Σ. For each i in I let Ai := { j ∈ I : j ⊇ i}. The family of all of these sets Ai generates a proper filter, so there is an ultrafilter U containing all sets of the form Ai.
Now for any formula φ in Σ we have:
- the set A{φ} is in U
- whenever j ∈ A{φ}, then φ ∈ j, hence φ holds in
- the set of all j with the property that φ holds in is a superset of A{φ}, hence also in U
Using Łoś's theorem we see that φ holds in the ultraproduct . So this ultraproduct satisfies all formulas in Σ.
See also
- List of Boolean algebra topics
- Löwenheim-Skolem theorem
- Herbrand's theorem
- Barwise compactness theorem
Notes
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - One of the biggest reasons investing in a Singapore new launch is an effective things is as a result of it is doable to be lent massive quantities of money at very low interest rates that you should utilize to purchase it. Then, if property values continue to go up, then you'll get a really high return on funding (ROI). Simply make sure you purchase one of the higher properties, reminiscent of the ones at Fernvale the Riverbank or any Singapore landed property Get Earnings by means of Renting
In its statement, the singapore property listing - website link, government claimed that the majority citizens buying their first residence won't be hurt by the new measures. Some concessions can even be prolonged to chose teams of consumers, similar to married couples with a minimum of one Singaporean partner who are purchasing their second property so long as they intend to promote their first residential property. Lower the LTV limit on housing loans granted by monetary establishments regulated by MAS from 70% to 60% for property purchasers who are individuals with a number of outstanding housing loans on the time of the brand new housing purchase. Singapore Property Measures - 30 August 2010 The most popular seek for the number of bedrooms in Singapore is 4, followed by 2 and three. Lush Acres EC @ Sengkang
Discover out more about real estate funding in the area, together with info on international funding incentives and property possession. Many Singaporeans have been investing in property across the causeway in recent years, attracted by comparatively low prices. However, those who need to exit their investments quickly are likely to face significant challenges when trying to sell their property – and could finally be stuck with a property they can't sell. Career improvement programmes, in-house valuation, auctions and administrative help, venture advertising and marketing, skilled talks and traisning are continuously planned for the sales associates to help them obtain better outcomes for his or her shoppers while at Knight Frank Singapore. No change Present Rules
Extending the tax exemption would help. The exemption, which may be as a lot as $2 million per family, covers individuals who negotiate a principal reduction on their existing mortgage, sell their house short (i.e., for lower than the excellent loans), or take part in a foreclosure course of. An extension of theexemption would seem like a common-sense means to assist stabilize the housing market, but the political turmoil around the fiscal-cliff negotiations means widespread sense could not win out. Home Minority Chief Nancy Pelosi (D-Calif.) believes that the mortgage relief provision will be on the table during the grand-cut price talks, in response to communications director Nadeam Elshami. Buying or promoting of blue mild bulbs is unlawful.
A vendor's stamp duty has been launched on industrial property for the primary time, at rates ranging from 5 per cent to 15 per cent. The Authorities might be trying to reassure the market that they aren't in opposition to foreigners and PRs investing in Singapore's property market. They imposed these measures because of extenuating components available in the market." The sale of new dual-key EC models will even be restricted to multi-generational households only. The models have two separate entrances, permitting grandparents, for example, to dwell separately. The vendor's stamp obligation takes effect right this moment and applies to industrial property and plots which might be offered inside three years of the date of buy. JLL named Best Performing Property Brand for second year running
The data offered is for normal info purposes only and isn't supposed to be personalised investment or monetary advice. Motley Fool Singapore contributor Stanley Lim would not personal shares in any corporations talked about. Singapore private home costs increased by 1.eight% within the fourth quarter of 2012, up from 0.6% within the earlier quarter. Resale prices of government-built HDB residences which are usually bought by Singaporeans, elevated by 2.5%, quarter on quarter, the quickest acquire in five quarters. And industrial property, prices are actually double the levels of three years ago. No withholding tax in the event you sell your property. All your local information regarding vital HDB policies, condominium launches, land growth, commercial property and more
There are various methods to go about discovering the precise property. Some local newspapers (together with the Straits Instances ) have categorised property sections and many local property brokers have websites. Now there are some specifics to consider when buying a 'new launch' rental. Intended use of the unit Every sale begins with 10 p.c low cost for finish of season sale; changes to 20 % discount storewide; follows by additional reduction of fiftyand ends with last discount of 70 % or extra. Typically there is even a warehouse sale or transferring out sale with huge mark-down of costs for stock clearance. Deborah Regulation from Expat Realtor shares her property market update, plus prime rental residences and houses at the moment available to lease Esparina EC @ Sengkang - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
Further reading
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
- ↑ See Truss (1997).
- ↑ Vaught, Robert L.: Alfred Tarski's work in model theory. J. Symbolic Logic 51 (1986), no. 4, 869–882
- ↑ Robinson, A.: Non-standard analysis. North-Holland Publishing Co., Amsterdam 1966. page 48.
- ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - ↑ See Hodges (1993).