Model theory studies mathematical structures through the first-order sentences and formulas they satisfy.
A consistent first-order theory is complete when it decides every sentence in its language.
Compactness gives a countable model elementarily equivalent to that contains a nonzero element divisible by every positive standard integer. It is not isomorphic to , so is not aleph-zero-categorical.
The complete theory of infinite-dimensional vector spaces over a fixed finite field is aleph-zero-categorical: every countably infinite model has countably infinite dimension and is therefore isomorphic to every other such model.
A theory has quantifier elimination when every formula is equivalent modulo the theory to a quantifier-free formula.
The back-and-forth method constructs an isomorphism by alternately extending finite partial isomorphisms to include elements from each structure.
A dense linear order without endpoints is a linear order in which a third point lies strictly between every two distinct points and every point has points both below and above it.
The theory of dense linear orders without endpoints eliminates quantifiers. A finite partial order isomorphism extends by placing each new point in the corresponding interval or ray.
An ultraproduct identifies two sequences when they agree on a set belonging to an ultrafilter and interprets symbols coordinatewise.
Łoś's theorem says that a first-order formula holds in an ultraproduct exactly when it holds in a set of factors belonging to the ultrafilter.
An extension is elementary when every formula with parameters from has the same truth value in both structures.
The complete type of a tuple over parameters records every formula over those parameters that the tuple satisfies.
The type space is the set of complete -types over a parameter set that are consistent with the complete theory of together with its diagram over .
A complete type is isolated when some formula belongs to no other complete type in . Equivalently, the basic open set determined by is the singleton .
Quantifier elimination for dense linear orders shows that the one-types over are determined by cuts: equality to a natural number, one of the intervals between consecutive natural numbers, the ray below zero, or the cut above every natural number. Only the last type is non-isolated.
A model is aleph-zero-homogeneous when every finite partial elementary map extends by one more element.
A complete theory is strongly minimal when every definable one-variable subset of every model is finite or cofinite.
A pregeometry is a closure operator with finite character and exchange. Algebraic closure in a strongly minimal theory is a pregeometry.
Articles by others on the same topic
Model theory is a branch of mathematical logic that deals with the relationship between formal languages (which consist of symbols and rules for combining them) and their interpretations or models. It focuses on understanding the structures that satisfy given logical formulas, and it examines the properties and relationships between those structures. Here are some key concepts in model theory: 1. **Structures**: A structure consists of a set, called the universe, along with operations, relations, and constants defined on that set.