# GetWiki

*model theory*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

model theory

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

**model theory**is the study of classes of mathematical structures (e.g. groups, fields, graphs, universes of set theory) from the perspective of mathematical logic. The objects of study are models of theories in a formal language. A set of sentences in a formal language is one of the components that form a

**theory**. A

**model**of a theory is a structure (e.g. an interpretation) that satisfies the sentences of that theory.Model theory recognizes and is intimately concerned with a duality: it examines semantical elements (meaning and truth) by means of syntactical elements (formulas and proofs) of a corresponding language: in a summary definition, dating from 1973, Model theory developed rapidly during the 1990s, and a more modern definition is provided by Wilfrid Hodges (1997): Other nearby areas of mathematics include combinatorics, number theory, arithmetic dynamics, analytic functions, and non-standard analysis.In a similar way to proof theory, model theory is situated in an area of interdisciplinarity among mathematics, philosophy, and computer science. The most prominent professional organization in the field of model theory is the Association for Symbolic Logic.

## Branches

This article focuses on finitary first order model theory of infinite structures. Finite model theory, which concentrates on finite structures, diverges significantly from the study of infinite structures in both the problems studied and the techniques used. Model theory in higher-order logics or infinitary logics is hampered by the fact that completeness and compactness do not in general hold for these logics. However, a great deal of study has also been done in such logics.Informally, model theory can be divided into classical model theory, model theory applied to groups and fields, and geometric model theory. A missing subdivision is computable model theory, but this can arguably be viewed as an independent subfield of logic.Examples of early theorems from classical model theory include GÃ¶del's completeness theorem, the upward and downward LÃ¶wenheimâ€“Skolem theorems, Vaught's two-cardinal theorem, Scott's isomorphism theorem, the omitting types theorem, and the Ryll-Nardzewski theorem. Examples of early results from model theory applied to fields are Tarski's elimination of quantifiers for real closed fields, Ax's theorem on pseudo-finite fields, and Robinson's development of non-standard analysis. An important step in the evolution of classical model theory occurred with the birth of stability theory (through Morley's theorem on uncountably categorical theories and Shelah's classification program), which developed a calculus of independence and rank based on syntactical conditions satisfied by theories.During the last several decades applied model theory has repeatedly merged with the more pure stability theory. The result of this synthesis is called geometric model theory in this article (which is taken to include o-minimality, for example, as well as classical geometric stability theory). An example of a proof from geometric model theory is Hrushovski's proof of the Mordellâ€“Lang conjecture for function fields. The ambition of geometric model theory is to provide a*geography of mathematics*by embarking on a detailed study of definable sets in various mathematical structures, aided by the substantial tools developed in the study of pure model theory.

## Universal algebra

Fundamental concepts in universal algebra are signatures Ïƒ and Ïƒ-algebras. Since these concepts are formally defined in the article on structures, the present article is an informal introduction which consists of examples of the way these terms are used.
The standard signature of rings is Ïƒring = {Ã—,+,âˆ’,0,1}, where Ã— and + are binary, âˆ’ is unary, and 0 and 1 are nullary.
The standard signature of semirings is Ïƒsmr = {Ã—,+,0,1}, where the arities are as above.
The standard signature of groups (with multiplicative notation) is Ïƒgrp = {Ã—,âˆ’1,1}, where Ã— is binary, âˆ’1 is unary and 1 is nullary.
The standard signature of monoids is Ïƒmnd = {Ã—,1}.
A ring is a Ïƒring-structure which satisfies the identities {{nowrap|

This is a very efficient way to define most classes of algebraic structures, because there is also the concept of Ïƒ-homomorphism, which correctly specializes to the usual notions of homomorphism for groups, semigroups, magmas and rings. For this to work, the signature must be chosen well.Terms such as the Ïƒring-term *u*+ (*v*+*w*) {{=}} (*u*+*v*) +*w*,}} {{nowrap|*u*+*v*{{=}}*v*+*u*,}} {{nowrap|*u*+ 0 {{=}}*u*,}} {{nowrap|*u*+ (âˆ’*u*) {{=}} 0,}} {{nowrap|*u*Ã— (*v*Ã—*w*) {{=}} (*u*Ã—*v*) Ã—*w*,}} {{nowrap|*u*Ã— 1 {{=}}*u*,}} {{nowrap|1 Ã—*u*{{=}}*u*,}} {{nowrap|*u*Ã— (*v*+*w*) {{=}} (*u*Ã—*v*) + (*u*Ã—*w*)}} and {{nowrap|(*v*+*w*) Ã—*u*{{=}} (*v*Ã—*u*) + (*w*Ã—*u*).}} A group is a Ïƒgrp-structure which satisfies the identities {{nowrap|*u*Ã— (*v*Ã—*w*) {{=}} (*u*Ã—*v*) Ã—*w*,}} {{nowrap|*u*Ã— 1 {{=}}*u*,}} {{nowrap|1 Ã—*u*{{=}}*u*,}} {{nowrap|*u*Ã—*u*âˆ’1 {{=}} 1}} and {{nowrap|*u*âˆ’1 Ã—*u*{{=}} 1.}} A monoid is a Ïƒmnd-structure which satisfies the identities {{nowrap|*u*Ã— (*v*Ã—*w*) {{=}} (*u*Ã—*v*) Ã—*w*,}} {{nowrap|*u*Ã— 1 {{=}}*u*}} and {{nowrap|1 Ã—*u*{{=}}*u*.}} A semigroup is a {Ã—}-structure which satisfies the identity {{nowrap|*u*Ã— (*v*Ã—*w*) {{=}} (*u*Ã—*v*) Ã—*w*.}} A magma is just a {Ã—}-structure.*t*(

*u*,

*v*,

*w*) given by {{nowrap|(

*u*+ (

*v*Ã—

*w*)) + (âˆ’1)}} are used to define identities {{nowrap|

*t*{{=}}

*t{{'}}*,}} but also to construct free algebras. An equational class is a class of structures which, like the examples above and many others, is defined as the class of all Ïƒ-structures which satisfy a certain set of identities. Birkhoff's theorem states:

A class of Ïƒ-structures is an equational class if and only if it is not empty and closed under subalgebras, homomorphic images, and direct products.

An important non-trivial tool in universal algebra are ultraproducts Pi_{iin I}A_i/U, where *I*is an infinite set indexing a system of Ïƒ-structures

*Ai*, and

*U*is an ultrafilter on

*I*.While model theory is generally considered a part of mathematical logic, universal algebra, which grew out of Alfred North Whitehead's (1898) work on abstract algebra, is part of algebra. This is reflected by their respective MSC classifications. Nevertheless, model theory can be seen as an extension of universal algebra.

## Finite model theory

Finite model theory is the area of model theory which has the closest ties to universal algebra. Like some parts of universal algebra, and in contrast with the other areas of model theory, it is mainly concerned with finite algebras, or more generally, with finite Ïƒ-structures for signatures Ïƒ which may contain relation symbols as in the following example:
The standard signature for graphs is Ïƒgrph={

A Ïƒ-homomorphism is a map that commutes with the operations and preserves the relations in Ïƒ. This definition gives rise to the usual notion of graph homomorphism, which has the interesting property that a bijective homomorphism need not be invertible. Structures are also a part of universal algebra; after all, some algebraic structures such as ordered groups have a binary relation }} *E*}, where*E*is a binary relation symbol. A graph is a Ïƒgrph-structure satisfying the sentence forall u forall v(uEv rightarrow vEu).- BOOK, Kopperman, R., Model Theory and Its Applications, Allyn and Bacon, Boston, 1972,
- BOOK, Marker, David, Model Theory: An Introduction, Springer, 2002, 0-387-98760-6, Graduate Texts in Mathematics 217,

### Other textbooks

- BOOK, Bell, John L., Slomson, Alan B., 2006, Models and Ultraproducts: An Introduction, reprint of 1974, 1969, Dover Publications, 0-486-44979-3,
- BOOK, Ebbinghaus, Heinz-Dieter, Flum, JÃ¶rg, Thomas, Wolfgang, Springer Science+Business Media, Springer, Mathematical Logic, 1994, 0-387-94258-0,
- BOOK, Hinman, Peter G., Fundamentals of Mathematical Logic, A K Peters, Ltd., A K Peters, 2005, 1-56881-262-0,
- BOOK, Hodges, Wilfrid, Wilfrid Hodges, Cambridge University Press, Model theory, 1993, 0-521-30442-3,
- BOOK, Manzano, MarÃa, MarÃa Manzano, Oxford University Press, Model theory, 1999, 0-19-853851-0,
- BOOK, Poizat, Bruno, Springer, A Course in Model Theory, 2000, 0-387-98655-3,
- BOOK, Rautenberg, Wolfgang, Wolfgang Rautenberg, 10.1007/978-1-4419-1221-3, A Concise Introduction to Mathematical Logic,weblink Springer Science+Business Media, New York City, New York, 3rd, 978-1-4419-1220-6, 2010,
- BOOK, Rothmaler, Philipp, Introduction to Model Theory, Taylor and Francis, Taylor & Francis, 2000, new, 90-5699-313-5,
- BOOK, Ziegler, Martin, Tent, Katrin, Cambridge University Press, A Course in Model Theory, 2012, 9780521763240,

### Free online texts

- BOOK, Chatzidakis, ZoÃ©, ZoÃ© Chatzidakis, 2001, Introduction to Model Theory, 26 pages,weblink
- BOOK, Pillay, Anand, Lecture Notes â€“ Model Theory, 2002,weblink 61 pages,
- {{Springer |title=Model theory |id=p/m064390}}
- Hodges, Wilfrid,
*Model theory*. The Stanford Encyclopedia Of Philosophy, E. Zalta (ed.). - Hodges, Wilfrid,
*First-order Model theory*. The Stanford Encyclopedia Of Philosophy, E. Zalta (ed.). - Simmons, Harold (2004),
*An introduction to Good old fashioned model theory*. Notes of an introductory course for postgraduates (with exercises). - J. Barwise and S. Feferman (editors), Model-Theoretic Logics, Perspectives in Mathematical Logic, Volume 8, New York: Springer-Verlag, 1985.

**- content above as imported from Wikipedia**

- "

- time: 12:50am EDT - Thu, Sep 19 2019

- "

__model theory__" does not exist on GetWiki (yet)- time: 12:50am EDT - Thu, Sep 19 2019

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 JUL 2019

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

© 2019 M.R.M. PARROTT | ALL RIGHTS RESERVED