|
For every natural mathematical structure there is a signature σ listing the constants, functions, and relations of the theory together with their valences, so that the object is naturally a σ-structure. Given a signature σ there is a unique first-order language Lσ that can be used to capture the first-order expressible facts about the σ-structure. There are two common ways to specify theories: List or describe a set of sentences in the language Lσ, called the axioms of the theory. Give a set of σ-structures, and define a theory to be the set of sentences in Lσ holding in all these models. For example, the "theory of finite fields" consists of all sentences in the language of fields that are true in all finite fields. An Lσ theory may: be consistent: no proof of contradiction exists; be satisfiable: there exists a σ-structure for which the sentences of the theory are all true (by the completeness theorem, satisfiability is equivalent to consistency); be complete: for any statement, either it or its negation is provable; have quantifier elimination; eliminate imaginaries; be finitely axiomatizable; be decidable: There is an algorithm to decide which statements are provable; be recursively axiomatizable; be Model complete or sub-model complete; be κ-categorical: All models of cardinality κ are isomorphic; be Stable or unstable. be ω-stable (same as totally transcendental for countable theories). be superstable have an atomic model have a prime model have a saturated model Pure identity theories The signature of the pure identity theory is empty, with no functions, constants, or relations. Pure identity theory has no (non-logical) axioms. It is decidable. One of the few interesting properties that can be stated in the language of pure identity theory is that of being infinite. This is given by an infinite set of axioms stating there are at least 2 elements, there are at least 3 elements, and so on: ∃x1 ∃x2 ¬x1 = x2, ∃x1 ∃x2 ∃x3 ¬x1 = x2 ∧ ¬x1 = x3 ∧ ¬x2 = x3,... These axioms define the theory of an infinite set. The opposite property of being finite cannot be stated in first-order logic for any theory that has arbitrarily large finite models: in fact any such theory has infinite models by the compactness theorem. In general if a property can be stated by a finite number of sentences of first-order logic then the opposite property can also be stated in first-order logic, but if a property needs an infinite number of sentences then its opposite property cannot be stated in first-order logic. Any statement of pure identity theory is equivalent to either σ(N) or to ¬σ(N) for some finite subset N of the non-negative integers, where σ(N) is the statement that the number of elements is in N. It is even possible to describe all possible theories in this language as follows. Any theory is either the theory of all sets of cardinality in N for some finite subset N of the non-negative integers, or the theory of all sets whose cardinality is not in N, for some finite or infinite subset N of the non-negative integers. (There are no theories whose models are exactly sets of cardinality N if N is an infinite subset of the integers.) The complete theories are the theories of sets of cardinality n for some finite n, and the theory of infinite sets. One special case of this is the inconsistent theory defined by the axiom ∃x ¬x = x. It is a perfectly good theory with many good properties: it is complete, decidable, finitely axiomatizable, and so on. The only problem is that it has no models at all. By Gödel's completeness theorem, it is the only theory (for any given language) with no models.[citation needed] Unary relations A set of unary relations Pi for i in some set I is called independent if for every two disjoint finite subsets A and B of I there is some element x such that Pi(x) is true for i in A and false for i in B. Independence can be expressed by a set of first-order statements. The theory of a countable number of independent unary relations is complete, but has no atomic models. It is also an example of a theory that is superstable but not totally transcendental. Equivalence relations The signature of equivalence relations has one binary infix relation symbol ~, no constants, and no functions. Equivalence relations satisfy the axioms: Reflexivity ∀x x~x; Symmetry ∀x ∀y x~y → y~x; Transitivity: ∀x ∀y ∀z (x~y ∧ y~z) → x~z. Some first order properties of equivalence relations are: ~ has an infinite number of equivalence classes; ~ has exactly n equivalence classes (for any fixed positive integer n); All equivalence classes are infinite; All equivalence classes have size exactly n (for any fixed positive integer n). The theory of an equivalence relation with exactly 2 infinite equivalence classes is an easy example of a theory which is ω-categorical but not categorical for any larger cardinal. The equivalence relation ~ should not be confused with the identity symbol '=': if x=y then x~y, but the converse is not necessarily true. Theories of equivalence relations are not all that difficult or interesting, but often give easy examples or counterexamples for various statements. The following constructions are sometimes used to produce examples of theories with certain spectra; in fact by applying them to a small number of explicit theories T one gets examples of complete countable theories with all possible uncountable spectra. If T is a theory in some language, we define a new theory 2T by adding a new binary relation to the language, and adding axioms stating that it is an equivalence relation, such that there are an infinite number of equivalence classes all of which are models of T. It is possible to iterate this construction transfinitely: given an ordinal α, define a new theory by adding an equivalence relation Eβ for each β<α, together with axioms stating that whenever β<γ then each Eγ equivalence class is the union of infinitely many Eβ equivalence classes, and each E0 equivalence class is a model of T. Informally, one can visualize models of this theory as infinitely branching trees of height α with models of T attached to all leaves. Orders The signature of orders has no constants or functions, and one binary relation symbols ≤. (It is of course possible to use ≥, < or > instead as the basic relation, with the obvious minor changes to the axioms.) We define x ≥ y, x < y, x > y as abbreviations for y ≤ x, x ≤ y ∧¬y ≤ x, y < x, Some first-order properties of orders: Transitive: ∀x ∀y ∀z x ≤ y∧y ≤ z → x ≤ z Reflexive: ∀x x ≤ x Antisymmetric: ∀x ∀y x ≤ y ∧ y ≤ x → x = y Partial: Transitive∧Reflexive∧Antisymmetric; Linear (or total): Partial ∧ ∀x ∀y x≤y ∨ y≤x Dense ∀x ∀z x < z → ∃y x < y ∧ y < z ("Between any 2 distinct elements there is another element") There is a smallest element: ∃x ∀y x ≤ y There is a largest element: ∃x ∀y y ≤ x Every element has an immediate successor: ∀x ∃y ∀z x < z ↔ y ≤ z The theory DLO of dense linear orders without endpoints (i.e. no smallest or largest element) is complete, ω-categorical, but not categorical for any uncountable cardinal. There are 3 other very similar theories: the theory of dense linear orders with a: Smallest but no largest element; Largest but no smallest element; Largest and smallest element. Being well ordered ("any non-empty subset has a minimal element") is not a first-order property; the usual definition involves quantifying over all subsets. Lattices Lattices can be considered either as special sorts of partially ordered sets, with a signature consisting of one binary relation symbol ≤, or as algebraic structures with a signature consisting of two binary operations ∧ and ∨. The two approaches can be related by defining a≤ b to mean a∧b=a. For two binary operations the axioms for a lattice are: Commutative laws: \forall a \forall b \; a \vee b = b \vee a \forall a \forall b\; a \wedge b = b \wedge a Associative laws: \forall a \forall b \forall c\; a \vee (b \vee c) = (a \vee b) \vee c \forall a \forall b \forall c\; a \wedge (b \wedge c) = (a \wedge b) \wedge c Absorption laws: \forall a \forall b \;a \vee (a \wedge b) = a \forall a \forall b \;a \wedge (a \vee b) = a For one relation ≤ the axioms are: Axioms stating ≤ is a partial order, as above. \forall a \forall b \exist c\; c\le a\wedge c\le b \wedge \forall d\;d\le a\wedge d\le b \rightarrow d\le c (existence of c=a∧b) \forall a \forall b \exist c\; a\le c\wedge b\le c \wedge \forall d\;a\le d\wedge b\le d \rightarrow c\le d (existence of c=a∨b) First order properties include: \forall x \forall y\forall z\;x \vee (y \wedge z) = (x \vee y) \wedge (x \vee z) (distributive lattices) \forall x \forall y\forall z\;x \vee (y \wedge (x \vee z)) = (x \vee y) \wedge (x \vee z) (modular lattices) Completeness is not a first order property of lattice. Graphs The signature of graphs has no constants or functions, and one binary relation symbol R, where R(x,y) is read as "there is an edge from x to y". The axioms for the theory of graphs are Symmetric: ∀x ∀y R(x,y)→ R(y,x) Anti-reflexive: ∀x ¬R(x,x) ("no loops") The theory of random graphs has the following extra axioms for each positive integer n: For any two disjoint finite sets of size n, there is a point joined to all points of the first set and to no points of the second set. (For each fixed n, it is easy to write this statement in the language of graphs.) The theory of random graphs is ω categorical, complete, and decidable, and its countable model is called the Rado graph. A statement in the language of graphs is true in this theory if and only if it is true with probability 1 for a random graph on a countable number of points. Boolean algebras There are several different signatures and conventions used for Boolean algebras: The signature has 2 constants, 0 and 1, and two binary functions ∧ and ∨ ("and" and "or"), and one unary function ¬ ("not"). This is a little confusing as the functions use the same symbols as the propositional functions of first-order logic. In set theory, a common convention is that the language has 2 constants, 0 and 1, and two binary functions · and +, and one unary function −. The three functions have the same interpretation as the functions in the first convention. Unfortunately, this convention clashes badly with the next convention: In algebra, the usual convention is that the language has 2 constants, 0 and 1, and two binary functions · and +. The function · has the same meaning as ∧, but a+b means a∨b∧¬(a∧b). The reason for this is that the axioms for a Boolean algebra are then just the axioms for a ring with 1 plus ∀x x2 = x. Unfortunately this clashes with the standard convention in set theory given above. The axioms are: The axioms for a distributive lattice (see above) ∀a∀b a∧¬a = 0, ∀a∀b a∨¬a = 1 (properties of negation) Some authors add the extra axiom ¬0=1, to exclude the trivial algebra with one element. Tarski proved that the theory of Boolean algebras is decidable. We write x ≤ y as an abbreviation for x ∧ y = x, and atom(x) as an abbreviation for ¬x = 0 ∧ ∀y y≤x → y = 0 ∨ y = x, read as "x is an atom", in other words a non-zero element with nothing between it and 0. Here are some first-order properties of Boolean algebras: Atomic: ∀x x=0 ∨ ∃y y≤x ∧ atom(y) Atomless: ∀x ¬atom(x) The theory of atomless Boolean algebras is ω-categorical and complete. For any Boolean algebra B, there are several invariants defined as follows. the ideal I(B) consists of elements that are the sum of an atomic and an atomless element. The quotient algebras Bi of B are defined inductively by B0=B, Bk+1 = Bk/I(Bk). The invariant m(B) is the smallest integer such that Bm+1 is trivial, or ∞ if no such integer exists. If m(B) is finite, the invariant n(B) is the number of atoms of Bm(B) if this number is finite, or ∞ if this number is infinite. The invariant l(B) is 0 if Bm(B) is atomic or if m(B) is ∞, and 1 otherwise. Then two Boolean algebras are elementarily equivalent if and only if their invariants l, m, and n are the same. In other words, the values of these invariants classify the possible completions of the theory of Boolean algebras. So the possible complete theories are: The trivial algebra (if this is allowed; sometimes 0≠1 is included as an axiom.) The theory with m=∞ The theories with m a natural number, n a natural number or ∞, and l = 0 or 1 (with l = 0 if n=0). Groups The signature of group theory has one constant 1 (the identity), one function of arity 1 (the inverse) whose value on t is denoted by t−1, and one function of arity 2, which is usually omitted from terms. For any integer n. tn is an abbreviation for the obvious term for the nth power of t. Groups are defined by the axioms Identity: ∀x 1x = x ∧ x1 = x Inverse: ∀x x−1x = 1 ∧ xx−1 = 1 Associative: ∀x∀y∀z (xy)z = x(yz) Some properties of groups that can be defined in the first-order language of groups are: Abelian ∀x ∀y xy = yx. Torsion free ∀x x2 = 1→x = 1, ∀x x3 = 1 → x = 1, ∀x x4 = 1 → x = 1, ... Divisible ∀x ∃y y2 = x, ∀x ∃y y3 = x, ∀x ∃y y4 = x, ... Infinite (as in identity theory) Exponent n (for any fixed positive integer n) ∀x xn = 1 Nilpotent of class n (for any fixed positive integer n) Solvable of class n (for any fixed positive integer n) The theory of Abelian groups is decidable. The theory of Infinite divisible torsion-free abelian groups is complete, as is the theory of Infinite abelian groups of exponent p (for p prime). The theory of finite groups is the set of first-order statements in the language of groups that are true in all finite groups (there are plenty of infinite models of this theory). It is not completely trivial to find any such statement that is not true for all groups: one example is "given two elements of order 2, either they are conjugate or there is a non-trivial element commuting with both of them". The properties of being finite, or free, or simple, or torsion are not first-order. More precisely, the first-order theory of all groups with one of these properties has models that do not have this property. Rings and fields The signature of (unital) rings has 2 constants 0 and 1, two binary functions + and ×, and, optionally, one unary inverse functions − −1. Rings Axioms: Addition makes the ring into an abelian group, multiplication is associative and has an identity 1, and multiplication is left and right distributive. Commutative rings The axioms for rings plus ∀x ∀y xy=yx. Fields The axioms for commutative rings plus ∀x ∃y xy=1 and ¬ 1=0. Many of the examples given here have only universal, or algebraic axioms. The class of structures satisfying such a theory has the property of being closed under substructure. For example, a subset of a group closed under the group actions of multiplication and inverse is again a group. Since the signature of fields does not usually include multiplicative and additive inverse, the axioms for inverses are not universal, and therefore a substructure of a field closed under addition and multiplication is not always a field. This can be remedied by adding unary inverse functions to the language. For any positive integer n the property that all equations of degree n have a root can be expressed by a single first-order sentence: ∀ a1 ∀ a2... ∀ an ∃x (...((x+a1)x +a2)x+...)x+an = 0 Perfect fields The axioms for fields, plus axioms for each prime number p stating that if p 1 = 0 (i.e. the field has characteristic p), then every field element has a pth root. Algebraically closed fields of characteristic p The axioms for fields, plus for every positive n the axiom that all polynomials of degree n have a root, plus axioms fixing the characteristic. The classical examples of complete theories. Categorical in all uncountable cardinals. The theory ACFp has a universal domain property, in the sense that every structure N satisfying the universal axioms of ACFp is a substructure of a sufficiently large algebraically closed field M \models ACF_0 , and additionally any two such embeddings N → M induce an automorphism of M. Finite fields. The theory of finite fields is the set of all first-order statements that are true in all finite fields. Significant examples of such statements can, for example, be given by applying the Chevalley–Warning theorem, over the prime fields. The name is a little misleading as the theory has plenty of infinite models. Ax proved that the theory is decidable. Formally real fields These are fields with the axiom For every positive n, the axiom ∀ a1 ∀ a2... ∀ an a1a1+a2a2+ ...+anan=0 → a1=0∨a2=0∨ ... ∨an=0 (0 is not a non-trivial sum of squares). Real closed fields Axioms: ∀x ∃y x=yy ∨ x+yy=0. For every odd positive n, the axiom stating that every polynomial of degree n has a root. For every positive n, the axiom ∀ a1 ∀ a2... ∀ an a1a1+a2a2+ ...+anan=0 → a1=0∨a2=0∨ ... ∨an=0 (0 is not a non-trivial sum of squares). The theory of real closed fields is effective and complete and therefore decidable (Tarski). p-adic fields: Ax & Kochen (1965) showed that the theory of p-adic fields is decidable and gave a set of axioms for it. Geometry Axioms for various systems of geometry usually use a typed language, with the different types corresponding to different geometric objects such as points, lines, circles, planes, and so on. The signature will often consist of binary incidence relations between objects of different types; for example, the relation that a point lies on a line. The signature may have more complicated relations; for example ordered geometry might have a ternary "betweenness" relation for 3 points, which says whether one lies between two others, or a "congruence" relation between 2 pairs of points. Some examples of axiomatized systems of geometry include ordered geometry, absolute geometry, affine geometry, Euclidean geometry, projective geometry, and hyperbolic geometry. For each of these geometries there are many different and inequivalent systems of axioms for various dimensions. Some of these axiom systems include "completeness" axioms that are not first order. As a typical example, the axioms for projective geometry use 2 types, points and lines, and a binary incidence relation between points and lines. If point and line variables are indicated by small and capital letter, and a incident to A is written as aA, then one set of axioms is \forall a\forall b\;\lnot a=b\rightarrow \exists C\; aC\and bC (There is a line through any 2 distinct points a,b ...) \forall a\forall b\forall C\forall D\; \lnot a=b\and aC\and bC \and aD\and bD\rightarrow C=D (... which is unique) \forall a\forall b\forall c\forall d\forall e\forall G\forall H \;aH\and bH\and eH\and cG\and dG\and eG\rightarrow\exists f\exists I\exists J\; aI\and cI\and fI\and bJ\and dJ\and fJ (Veblen's axiom: if ab and cd lie on intersecting lines, then so do ac and bd.) \forall A\exists b\exists c\exists d\; bA\and cA\and dA\and \lnot b=c\and \lnot b=d\and \lnot c=d (Every line has at least 3 points) Euclid did not state all the axioms for Euclidean geometry explicitly, and the first complete list was given by Hilbert in Hilbert's axioms. This is not a first order axiomatization as one of Hilbert's axioms is a second order completeness axiom. Tarski's axioms are a first order axiomatization of Euclidean geometry. Tarski showed this axiom system is complete and decidable by relating it to the complete and decidable theory of real closed fields. Differential algebra The theory DF of differential fields. The signature is that of fields (0, 1, +, -, ×) together with a unary function ∂, the derivation. The axioms are those for fields together with \forall u\forall v\,\partial(uv) = u \,\partial v + v\, \partial u \forall u\forall v\,\partial (u + v) = \partial u + \partial v\ . For this theory one can add the condition that the characteristic is p, a prime or zero, to get the theory DFp of differential fields of characteristic p (and similarly with the other theories below). If K is a differential field then the field of constants k = \{u \in K : \partial(u) = 0\}. The theory of differentially perfect fields is the theory of differential fields together with the condition that the field of constants is perfect; in other words for each prime p it has the axiom: \forall u \,\partial(u)=0 \and p 1 = 0\rightarrow \exists v\, v^p=u (There is little point in demanding that the whole field should be perfect field, because in non-zero characteristic this implies the differential is 0.) For technical reasons to do with quantifier elimination it is sometimes more convenient to force the constant field to be perfect by adding a new symbol r to the signature with the axioms \forall u \,\partial(u)=0 \and p 1 = 0 \rightarrow r(u)^p=u \forall u \,\lnot \partial(u)=0\rightarrow r(u)=0. The theory of DCF differentially closed fields is the theory of differentially perfect fields with axioms saying that such that if f and g are differential polynomials and the separant of f is nonzero and g≠0 and f has order greater than that of g, then there is some x in the field with f(x)=0 and g(x)≠0. Addition The theory of the natural numbers with a successor function has signature consisting of a constant 0 and a unary function S ("successor": S(x) is interpreted as x+1), and has axioms: ∀x ¬ Sx = 0 ∀x∀y Sx = Sy → x = y Let P(x) be a first-order formula with a single free variable x. Then the following formula is an axiom: (P(0) ∧ ∀x(P(x)→P(Sx))) → ∀y P(y). The last axiom (induction) can be replaced by the axioms For each integer n>0, the axiom ∀x SSS...Sx ≠ x (with n copies of S) ∀x ¬ x = 0 → ∃y Sy = x The theory of the natural numbers with a successor function is complete and decidable, and is κ-categorical for uncountable κ but not for countable κ. Presburger arithmetic is the theory of the natural numbers under addition, with signature consisting of a constant 0, a unary function S, and a binary function +. It is complete and decidable. The axioms are ∀x ¬ Sx = 0 ∀x∀y Sx = Sy → x = y ∀x x + 0 = x ∀x∀y x + Sy = S(x + y) Let P(x) be a first-order formula with a single free variable x. Then the following formula is an axiom: (P(0) ∧ ∀x(P(x)→P(Sx))) → ∀y P(y). Arithmetic Many of the first order theories described above can be extended to complete recursively enumerable consistent theories. This is no longer true for most of the following theories; they can usually encode both multiplication and addition of natural numbers, and this gives them enough power to encode themselves, which implies that Gödel's incompleteness theorem applies and the theories can no longer be both complete and recursively enumerable (unless they are inconsistent). The signature of a theory of arithmetic has: The constant 0; The unary function, the successor function, here denoted by prefix S, or by prefix σ or postfix ′ elsewhere; Two binary functions, denoted by infix + and ×, called "addition" and "multiplication." Some authors take the signature to contain a constant 1 instead of the function S, then define S in the obvious way as St = 1 + t. Robinson arithmetic (also called Q). Axioms (1) and (2) govern the distinguished element 0. (3) assures that S is an injection. Axioms (4) and (5) are the standard recursive definition of addition; (6) and (7) do the same for multiplication. Robinson arithmetic can be thought of as Peano arithmetic without induction. Q is a weak theory for which Gödel's incompleteness theorem holds. Axioms: ∀x ¬ Sx = 0 ∀x ¬ x = 0 → ∃y Sy = x ∀x∀y Sx = Sy → x = y ∀x x + 0 = x ∀x∀y x + Sy = S(x + y) ∀x x × 0 = 0 ∀x∀y x × Sy = (x × y) + x. IΣn is first order Peano arithmetic with induction restricted to Σn formulas (for n = 0, 1, 2, ...). The theory IΣ0 is often denoted by IΔ0. This is a series of more and more powerful fragments of Peano arithmetic. The case n = 1 has about the same strength as primitive recursive arithmetic (PRA). Exponential function arithmetic (EFA) is IΣ0 with an axiom stating that xy exists for all x and y (with the usual properties). First order Peano arithmetic, PA. The "standard" theory of arithmetic. The axioms are the axioms of Robinson arithmetic above, together with the axiom scheme of induction: \phi(0) \wedge (\forall x \phi(x) \rightarrow \phi(Sx)) \rightarrow (\forall x \phi(x)) for any formula φ in the language of PA. φ may contain free variables other than x. Kurt Gödel's 1931 paper proved that PA is incomplete, and has no consistent recursively enumerable completions. Complete arithmetic (also known as true arithmetic) is the theory of the standard model of arithmetic, the natural numbers N. It is complete but does not have a recursively enumerable set of axioms. Second order arithmetic Second-order arithmetic can refer to a first order theory (in spite of the name) with two types of variables, thought of as varying over integers and subsets of the integers. (There is also a theory of arithmetic in second order logic that is called second order arithmetic. It has only one model, unlike the corresponding theory in first order logic, which is incomplete.) The signature will typically be the signature 0, S, +, × of arithmetic, together with a membership relation ∈ between integers and subsets (though there are numerous minor variations). The axioms are those of Robinson arithmetic, together with axiom schemes of induction and comprehension. There are many different subtheories of second order arithmetic that differ in which formulas are allowed in the induction and comprehension schemes. In order of increasing strength, five of the most common systems are \mathsf{RCA}_0, Recursive Comprehension \mathsf{WKL}_0, Weak König's lemma \mathsf{ACA}_0, Arithmetical comprehension \mathsf{ATR}_0, Arithmetical Transfinite Recursion \Pi^1_1\mbox{-}\mathsf{CA}_0, \Pi^1_1 comprehension These are defined in detail in the articles on second order arithmetic and reverse mathematics. Set theories The usual signature of set theory has one binary relation ∈, no constants, and no functions. Some of the theories below are "class theories" which have two sorts of object, sets and classes. There are three common ways of handling this in first-order logic: Use first-order logic with two types. Use ordinary first-order logic, but add a new unary predicate "Set", where "Set(t)" means informally "t is a set". Use ordinary first-order logic, and instead of adding a new predicate to the language, treat "Set(t)" as an abbreviation for "∃y t∈y" Some first order set theories include: Weak theories lacking powersets: S' (Tarski, Mostowski, and Robinson, 1953); (finitely axiomatizable) General set theory; Kripke-Platek set theory; KP; Zermelo set theory; Z Ackermann set theory; Zermelo-Fraenkel set theory; ZF, ZFC; Von Neumann-Bernays-Gödel set theory; NBG; (finitely axiomatizable) Morse–Kelley set theory; MK; Tarski–Grothendieck set theory; TG; New Foundations; (finitely axiomatizable) Scott-Potter set theory Positive set theory Some extra first order axioms that can be added to one of these (usually ZF) include: axiom of choice, axiom of dependent choice Generalized continuum hypothesis Martin's axiom (usually together with the negation of the continuum hypothesis), Martin's maximum ◊ and ♣ Axiom of constructibility (V=L) proper forcing axiom analytic determinacy, projective determinacy, Axiom of determinacy Many large cardinal axioms In mathematical logic, a first-order theory is given by a set of axioms in some language. This entry lists some of the more common examples used in model theory and some of their properties. |
About us|Jobs|Help|Disclaimer|Advertising services|Contact us|Sign in|Website map|Search|
GMT+8, 2015-9-11 21:24 , Processed in 0.142604 second(s), 16 queries .
