model theory

Model theory is a branch of mathematical logic which deals with the general problem of classifying mathematical structures. While every branch of mathematics has its own classifying problem (such as the classification of finite simple groups (http://planetmath.org/ExamplesOfFiniteSimpleGroups) or the classification of smooth manifolds), the approach of model theory is unique in attempting to classify structures in general by the sentences which are true of those structures. Like most classification problems, this problem is almost certainly unsolvable when stated in full generality. However, many special cases are worthy of study.

The basic theoretical notions in model theory are the structure and the theory. A structure (http://planetmath.org/StructuresAndSatisfaction), sometimes called an $L$ -structure, is a set with associated symbols (http://planetmath.org/Signature) representing constants, relations, and functions. A theory is a collection of sentences in a formal language. We say that a structure $\\mathfrak{K}$ satisfies a sentence $\\varphi$ provided that the sentence is true no matter how its variables are interpreted in $\\mathfrak{K}$ . If $\\mathfrak{K}$ satisfies all sentences of a theory $T$ , then we say that $\\mathfrak{K}$ is a model or $T$ , or $\\mathfrak{K}$ models $T$ , and write $\\mathfrak{K}\\models T$ . This allows us to talk about the class of models of a particular theory or the theory of a particular structure.

Basic constructions in model theory include elementary extensions, ultrapowers and ultraproducts, and the elimination of imaginaries. Some of the basic results of model theory include the Löwenheim-Skolem theorem (http://planetmath.org/DownwardLowenheimSkolemTheorem) (in downward and upward (http://planetmath.org/UpwardLowenheimSkolemTheorem) forms), the compactness theorem for first-order logic (http://planetmath.org/CompactnessTheoremForFirstOrderLogic), and Łoś’s theorem. Important concepts include Morley rank, o-minimality, and quantifier elimination.

Early pioneers of model theory include Löwenheim, Skolem, Gödel, Tarski, and Maltsev, and the work of Henkin, Robinson, and (again) Tarski helped distinguish model theory from the rest of mathematical logic. Ax and Kochen used model theory to prove a result on Diophantine problems over function fields, and Hrushovski used model theory to prove the Mordell–Lang conjecture for function fields.

References

1 C. C. Chang and H. J. Keisler, Model theory, North-Holland Publishing Company, Amsterdam, 1973.
2 W. Hodges, A shorter model theory, Cambridge University Press, 1997 (2000).
3 M. Manzano, Model theory, Oxford Logic Guides 37, Clarendon Press, Oxford, 1999.
4 B. Poizat, Course in model theory: an introduction in contemporary mathematical logic, Springer Verlag, 1999.

单词	ModelTheory
释义	model theory Model theory is a branch of mathematical logic which deals with the general problem of classifying mathematical structures. While every branch of mathematics has its own classifying problem (such as the classification of finite simple groups (http://planetmath.org/ExamplesOfFiniteSimpleGroups) or the classification of smooth manifolds), the approach of model theory is unique in attempting to classify structures in general by the sentences which are true of those structures. Like most classification problems, this problem is almost certainly unsolvable when stated in full generality. However, many special cases are worthy of study. The basic theoretical notions in model theory are the structure and the theory. A structure (http://planetmath.org/StructuresAndSatisfaction), sometimes called an $L$ -structure, is a set with associated symbols (http://planetmath.org/Signature) representing constants, relations, and functions. A theory is a collection of sentences in a formal language. We say that a structure $\\mathfrak{K}$ satisfies a sentence $\\varphi$ provided that the sentence is true no matter how its variables are interpreted in $\\mathfrak{K}$ . If $\\mathfrak{K}$ satisfies all sentences of a theory $T$ , then we say that $\\mathfrak{K}$ is a model or $T$ , or $\\mathfrak{K}$ models $T$ , and write $\\mathfrak{K}\\models T$ . This allows us to talk about the class of models of a particular theory or the theory of a particular structure. Basic constructions in model theory include elementary extensions, ultrapowers and ultraproducts, and the elimination of imaginaries. Some of the basic results of model theory include the Löwenheim-Skolem theorem (http://planetmath.org/DownwardLowenheimSkolemTheorem) (in downward and upward (http://planetmath.org/UpwardLowenheimSkolemTheorem) forms), the compactness theorem for first-order logic (http://planetmath.org/CompactnessTheoremForFirstOrderLogic), and Łoś’s theorem. Important concepts include Morley rank, o-minimality, and quantifier elimination. Early pioneers of model theory include Löwenheim, Skolem, Gödel, Tarski, and Maltsev, and the work of Henkin, Robinson, and (again) Tarski helped distinguish model theory from the rest of mathematical logic. Ax and Kochen used model theory to prove a result on Diophantine problems over function fields, and Hrushovski used model theory to prove the Mordell–Lang conjecture for function fields. References 1 C. C. Chang and H. J. Keisler, Model theory, North-Holland Publishing Company, Amsterdam, 1973. 2 W. Hodges, A shorter model theory, Cambridge University Press, 1997 (2000). 3 M. Manzano, Model theory, Oxford Logic Guides 37, Clarendon Press, Oxford, 1999. 4 B. Poizat, Course in model theory: an introduction in contemporary mathematical logic, Springer Verlag, 1999.
随便看	ProofOfCountingTheorem proof of counting theorem ProofOfCramersRule proof of Cramer’s rule ProofOfCriterionForConformalMappingOfRiemannianSpaces proof of criterion for conformal mapping of Riemannian spaces ProofOfCriterionForConvexity proof of criterion for convexity ProofOfCriterionForConvexityII proof of criterion for convexity II ProofOfCrossingLemma proof of crossing lemma ProofOfCyclicVectorTheorem proof of cyclic vector theorem ProofOfDalphaXYXalphaYYalphaXalphaXYglobalCoordinatefree ProofOfDalphaXYXalphaYYalphaXalphaXYlocalCoordinates ProofOfDarbouxsTheorem ProofOfDarbouxsTheoremsymplecticGeometry proof of Darboux’s theorem proof of Darboux’s theorem (symplectic geometry) ProofOfDedekindDomainsWithFinitelyManyPrimesArePIDs proof of Dedekind domains with finitely many primes are PIDs ProofOfDedekindMertensLemma proof of Dedekind-Mertens lemma ProofOfDehnsTheorem