nLab theory

This entry is about the notion in logic. For the notion of the same name in physics see at theory (physics).

Contents

Idea

In mathematical logic, a theory is a formal language used to precisely axiomatize a certain class of models.

In principle also all other notions of theory, such as in the sense of physics should be special cases of this, but in practice of course there are many systems called “theories” which are not (yet) as fully formalized as in mathematical logic.

Definition

There are several different viewpoint on theories:

• The

syntactic view

is that the theory itself consists of a set of formulas in the first order language $\mathrm{Lang}\left(\Sigma \right)$ of a signature $\Sigma$. Classically, these formulas are assumed to have no free variables (i.e. to be “sentences”), but in weaker logics that lack universal quantification it is better to take them to be formulas-in-context. One also sometimes considers the theory to also include all logical consequences (aka theorems) of the axioms in $A$, relative to (some specified) fragment of first-order logic — that is, to be “saturated” with respect to provability.

• The

semantic view

is that the theory is given by the class of its models appropriate to that fragment of logic. Gödel’s completeness theorem is that a sentence in $𝒯$ is a theorem iff it is satisfied in every model.

• The

categorical view

is that the logical formalism of a theory $𝒯$ can frequently be embodied in a syntactic category of terms ${C}_{𝒯}$, so that models of a theory $𝒯$ are identified with functors

${C}_{𝒯}\to \mathrm{Set}$C_{\mathcal{T}} \to Set

that preserve some (typically property-like) structures on ${C}_{𝒯}$, such as certain classes of colimits or of limits, pertinent to the fragment of logic at hand. Then a completeness theorem would be the statement that the canonical map

${C}_{𝒯}\to \prod _{\mathrm{models}F\mathrm{in}\mathrm{Set}}\mathrm{Set}$C_{\mathcal{T}} \to \prod_{models F in Set} Set

is a full faithful embedding (one that preserves all relevant logical structure). For this reason, completeness theorems are also known as embedding theorems.

Hm, is that the way it should be said?

In fact, the notion of model can be generalized away from $\mathrm{Set}$ to more general categories, namely those that have enough structure to “internalize” the fragment of logic at hand. From this very general point of view on model, the syntactic category ${C}_{𝒯}$ is the generic or universal model for $𝒯$, and if we simply call ${C}_{𝒯}$ the theory, then models and theories are placed on the same footing.

Syntactic view

Definition

In first-order logic, a theory $𝒯$ is presented by

1. a signature $\Sigma$, specifying the allowed types of variables and the functions and relations between these;

2. a set $A$ of sequents of formula?s in this signature, called the axioms of the theory: expressed in the first-order language $\mathrm{Lang}\left(\Sigma \right)$ with equality generated by $\Sigma$

For instance (Johnstone, def. D1.1.6).

(…)

(…)

(…)

Examples

Classes of theories

There are many different kinds of “theory” depending on the strength of the “logic”: a by-no-means complete list includes

and corresponding theories for these logics.

Hierarchy of theories: cartesian, regular, coherent, geometric

There is a hierarchy of theories that can be interpreted in the internal logic of a hierarchy of types of categories. Since predicates in the internal logic are represented by subobjects, in order to interpret any connective or quantifier in the internal logic, one needs a corresponding operation on subobjects to exist in the category in question, and be well-behaved. For instance:

• cartesian theories Since $\wedge$ and $\top$ are represented by intersections and identities (top elements), these can be interpreted in any lex category. Theories involving only these are cartesian theories.

• regular theories Since $\exists$ is represented by the image of a subobject, it can be interpreted in any regular category. Theories involving only $\wedge$, $\top$, and $\exists$ are regular theories.

• coherent theories Since $\vee$ and $\perp$ are represented by union and bottom elements, these can be interpreted in any coherent category. Theories which add these to regular logic are called coherent theories.

• geometric theories Finally, theories which also involve infinitary $\bigvee$, which is again represented by an infinitary union, can be interpreted in infinitary coherent categories, aka geometric categories. These are geometric theories.

Note that the axioms of one of these theories are actually of the form

$\phi {⊢}_{\stackrel{⇀}{x}}\psi$\varphi \vdash_{\vec{x}} \psi

where $\phi$ and $\psi$ are formulas involving only the specified connectives and quantifiers, $⊢$ means entailment, and $\stackrel{⇀}{x}$ is a context. Such an axiom can also be written as

$\forall \stackrel{⇀}{x}.\left(\phi ⇒\psi \right)$\forall \vec{x}. (\varphi \Rightarrow \psi)

so that although $⇒$ and $\forall$ are not strictly part of any of the above logics, they can be applied “once at top level.” In an axiom of this form for geometric logic, the formulas $\phi$ and $\psi$ which must be built out of $\top$, $\wedge$, $\perp$, $\bigvee$, and $\exists$ are sometimes called positive formulas.

Abelian theories

Interestingly, one form of logic which made an early appearance but is not ordinarily thought of as logic at all is the logic of abelian categories, which is characterized by certain exactness properties. Here a small abelian category $A$ can be thought of as a syntactic site for some “abelian theory”; models of the theory are exact additive functors with domain $A$. The classical models would in fact be exact additive functors $A\to \mathrm{Ab}$, or exact additive functors to a category of modules. A “Freyd-Heron-Lubkin-Mitchell” embedding theorem is then a completeness theorem with respect to the classical models, and assures us that a statement in the language of abelian category theory is provable if and only if it is true when interpreted in any module category.

Specific examples

The simplest nontrivial theory is the

A still pretty simple but very nontrivial theory is

The theories

• $\mathrm{Th}\left(\mathrm{Cat}\right)$ of categories

• $\mathrm{Th}\left(\mathrm{Lex}\right)$ of finitely complete categories

• $\mathrm{Th}\left(\mathrm{Topos}\right)$ of elementary toposes

• $\mathrm{Th}\left(\mathrm{ETCS}\right)$ of sets (ETCS)

are discussed at fully formal ETCS.

Models for a theory

Set-theoretic models for a first-order theory in syntactic approach

The basic concept is of a structure for a first-order language $L$: a set $M$ together with an interpretation of $L$ in $M$. A theory is specified by a language and a set of sentences in $L$. An $L$-structure $M$ is a model of $T$ if for every sentence $\varphi$ in $T$, its interpretation in $M$, ${\varphi }^{M}$ is true (”$\varphi$ holds in $M$”). We say that $T$ is consistent or satisfiable (relative to the universe in which we do model theory) if there exist at least one model for $T$ (in our universe). Two theories, ${T}_{1}$, ${T}_{2}$ are said to be equivalent if they have the same models.

Given a class $K$ of structures for $L$, there is a theory $\mathrm{Th}\left(K\right)$ consisting of all sentences in $L$ which hold in every structure from $K$. Two structures $M$ and $N$ are elementary equivalent (sometimes written by equality $M=N$, sometimes said “elementarily equivalent”) if $\mathrm{Th}\left(M\right)=\mathrm{Th}\left(N\right)$, i.e. if they satisfy the same sentences in $L$. Any set of sentences which is equivalent to $\mathrm{Th}\left(K\right)$ is called a set of axioms of $K$. A theory is said to be finitely axiomatizable if there exist a finite set of axioms for $K$.

A theory is said to be complete if it is equivalent to $\mathrm{Th}\left(M\right)$ for some structure $M$.

Categorical point of view and models in topoi

From the categorical point of view, for every theory $T$ there exists a category ${C}_{T}$ – the syntactic category ${C}_{T}$ – such that a model for $T$ is a functor ${C}_{T}\to 𝒯$ into some topos $T$, satisfying certain conditions.

For instance the syntactic categories of Lawvere theories are precisely those categories that have finite cartesian products and in which every object is isomorphic to a finite cartesian power ${x}^{n}$ of a distinguished object $x$. A model for a Lawvere theory is precisely a finite product preserving functor ${C}_{T}\to 𝒯$.

We say a functor ${𝒯}_{1}\to {𝒯}_{2}$ of toposes (for instance a logical morphism or a geometric morphism) preserves a theory $T$ if for every model ${C}_{T}\to {𝒯}_{1}$ of $T$ in ${𝒯}_{1}$, the composite ${C}_{T}\to {𝒯}_{1}\to {𝒯}_{2}$ is a model of $T$ in ${𝒯}_{2}$.

For instance, every geometric morphism preserves every Lawvere theory since, being a right adjoint, it preserves limits, hence finite products.

References

• H. Jerome Keisler, Fundamentals of model theory, A2 in JOhn Barwise, Handbook of mathematical logic (pp.47-103), North Holland 1977

A standard textbook reference for the categorical semantics is section D of

A discussion of the relation between theories and their syntactic categories is at

Other references include

In Coq theories are specified with the

Revised on January 6, 2013 05:17:27 by Urs Schreiber (89.204.139.89)