home | alphabetical index | |||||

## Model theory
In mathematics, The independence of the axiom of choice and the continuum hypothesis from the other axioms of set theory (proven by Paul Cohen and Kurt Gödel) are the two most famous results arising from model theory. It was proven that both the axiom of choice and its negation are consistent with the Zermelo-Fraenkel axioms of set theory; the same result holds for the continuum hypothesis. These results are a part of Axiomatic Set Theory, a particular application of Model Theory.
An example of the concepts of Model Theory is provided by the theory of the real numbers. We start with a set of individuals, where each individual is a real number, and a set of relations and/or functions, such as {×,+,-,.,0,1}. If we ask a question such as "∃ Model theory is then concerned with what is provable within given mathematical systems, and how these systems relate to each other. It is particularly concerned with what happens when we try to extend some system by the addition of new axioms or new language constructs. A model is formally defined in context of some language L, following Tarski's concept of truth. The model consists of two things:
- A universe set U which contains all the objects of interest (the "domain of discourse"), and
- a mapping from L to U (called the evaluation mapping or interpretation function) which has as its domain all constant, predicate and function symbols in the language.
theory is defined as a set of sentences which is consistent; often it is also defined to be closed under logical consequence. Under this definition a theory is thus a maximally consistent set of sentences. For example, the set of all sentences true in some particular model (e.g. the reals) or class of models is a theory.Completeness in model theory is defined as the property that every statement in a language or its opposite is provable from some theory. Complete theories are desirable since they describe fully some model. The compactness theorem states that a set of sentences S is satisfiable, i.e., has a model, if every finite subset of S is satisfiable. In the context of proof theory the analogous statement is trivial, since every proof can have only a finite number of antecedents used in the proof; in the context of model theory however, this proof is somewhat more difficult. There are two well known proofs, one by Gödel (which goes via proofs) and one by Malcev (which is more direct).
Model theory is concerned with first order logic, and to first order logic all cardinals look the same. This is expressed in the Lowenheim-Skolem theorems - which state that any theory with an infinite model So in particular, set theory (whose language is countable) has a countable model - this is known as Skolem's Paradox, even though it's true! To see why it was thought paradoxical, consider that there are sentences in set theory which postulate the existence of uncountable sets - and these sentences are true in our countable model. TODO - Vaught's test. Extensions, Embeddings and Diagrams. To give a flavor, mentioning the hyperreals would be good. (All of these need substantial filling out)
See also: - Proof theory
- Hyperreals
- Compactness theorem
- Descriptive complexity
| |||||

copyright © 2004 FactsAbout.com |