Interpretable structure

Interpretable structure

In model theory, a structure "N" is called interpretable in "M" if all the components (universe, functions, relations etc.) of "N" can be defined in terms of the components of "M". In particular, the universe of "N" is represented as a definable subset of some power of the universe of "M"; sometimes a definable quotient of the universe of "M" is employed instead of the universe itself. Interpretability entails that every formula in the language of "N" can be translated into corresponding formula in the language of "M" that essentially expresses the same content.

One of the goals of set theory in early 20th century was to build a set-theoretic universe in which all mathematical structures could be interpreted Fact|date=July 2007.

Definition

Suppose that L_1,L_2 are two first order languages. Let M be an L_1-structure and N be an L_2-structure.

Let n be a natural number. Suppose we have chosen the following

* A L_1-formula psi_D which has n free variables.
* A L_1-formula psi_E which has 2n free variables.
* For each constant symbol c of L_2 a L_1-formula psi_c with n free variables.
* For each m-ary function symbol f of L_2 a L_1-formula psi_f with (m+1)n free variables.
* For each m-ary relation symbol symbol R of L_2 a L_1-formula psi_R with mn free variables.

Suppose that psi_E defines an equivalence relation E on the set defined by psi_D. Suppose that sigma is a bijection from the equivalence classes of E to the domain of N.

The intuition behind the following definition is that the interpretation of each symbol in L_2 is controlled by the sets defined by the corresponding formula we chose above.

Then we say that (psi_D,psi_E,{psi_c:c in L_2},{psi_f:f in L_2},{psi_R:R in L_2},sigma) is an "interpretation" of N in M iff the following all hold:

* For each constant symbol c in L_2 and every a in M^n, we have that sigma(a/E)=c^N Leftrightarrow M models psi_c(a).
* For each m-ary function symbol f in L_2 and every a_1,ldots,a_m,b in M^{n}, we have that f^N(sigma(a_1/E),ldots,sigma(a_m/E))=sigma(b/E) Leftrightarrow M models psi_f(a_1,ldots,a_m,b).
* For each m-ary relation symbol R in L_2 and every a_1,ldots,a_m in M^{n}, we have that R^N(sigma(a_1/E),ldots,sigma(a_m/E)) Leftrightarrow M models psi_R(a_1,ldots,a_m).

Example: Valued Fields

Let L_{RING} be a language with two binary function symbols +, imes, a unary function symbol -, two constant symbols 0,1. We call this the language of rings. Let L be an extension of L_{RING} by the unary predicate symbol V.

Suppose that F is a field, and D is a Valuation ring of F.

Suppose we make F into an L-structure by interpreting +, imes,-,0,1 via the field on F, and so that for each a in F, F models V(a) iff a in D.

Now, the maximal ideal M of D is definable (without parameters) via the formula V(x) land forall y (yx=1 ightarrow lnot v(y).

In this way one can show that the residue field D/M as a structure in the language of rings is interpretable in F.

Similarly, the units F^*of F and the units D^* of D are definable, and one can interpret the quotient as an ordered group.

Note that in general there are many more structures interpretable in a valued field.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Structure de phrase — Phrase Pour les articles homonymes, voir Phrase (homonymie). En grammaire, une phrase peut être considérée comme un ensemble autonome, réunissant des unités syntaxiques organisées selon différents réseaux de relations plus ou moins complexes… …   Wikipédia en Français

  • Interpretability — The concept of interpretability is one in mathematical logic. Assume T and S are formal theories. Slightly simplified, T is said to be interpretable in S iff the language of T can be translated into the language of S in such a way that S proves… …   Wikipedia

  • List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic …   Wikipedia

  • List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… …   Wikipedia

  • Knowledge modeling — is a process of creating a computer interpretable model of knowledge or standard specifications about a kind of process and/or about a kind of facility or product. The resulting knowledge model can only be computer interpretable when it is… …   Wikipedia

  • Minimalist program — Linguistics …   Wikipedia

  • Transformational grammar — In linguistics, a transformational grammar, or transformational generative grammar (TGG), is a generative grammar, especially of a natural language, that has been developed in a Chomskyan tradition. Additionally, transformational grammar is the… …   Wikipedia

  • Linguistic minimalism — Minimalism in the sense described here is not related to Minimalism, the artistic and cultural movement. Much current research in transformational grammar is inspired by Noam Chomsky s Minimalist Program . [cite book|title=The Minimalist… …   Wikipedia

  • History of molecular biology — The history of molecular biology begins in the 1930s with the convergence of various, previously distinct biological disciplines: biochemistry, genetics, microbiology, and virology. With the hope of understanding life at its most fundamental… …   Wikipedia

  • Acte De Langage — Un acte de langage est un moyen mis en œuvre par un locuteur pour agir sur son environnement par ses mots : il cherche à informer, inciter, demander, convaincre, etc. son ou ses interlocuteurs par ce moyen. L acte de langage désigne donc… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”