PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: Very high
model (Definition)

Let $ \tau$ be a signature and $ \varphi$ be a sentence over $ \tau$. A structure $ \mathcal{M}$ for $ \tau$ is called a model of $ \varphi$ if

$\displaystyle \mathcal{M}\models \varphi,$
where $ \models$ is the satisfaction relation. When $ \mathcal{M}\models \varphi$, we says that $ \varphi$ satisfies $ \mathcal{M}$, or that $ \mathcal{M}$ is satisfied by $ \varphi$.

More generally, we say that a $ \tau$-structure $ \mathcal{M}$ is a model of a theory $ T$ over $ \tau$, if $ \mathcal{M}\models \varphi$ for every $ \varphi\in T$. When $ \mathcal{M}$ is a model of $ T$, we say that $ T$ satisfies $ \mathcal{M}$, or that $ \mathcal{M}$ is satisfied by $ T$, and is written

$\displaystyle \mathcal{M}\models T.$

Example. Let $ \tau=\lbrace \cdot \rbrace$, where $ \cdot$ is a binary operation symbol. Let $ x,y,z$ be variables and

$\displaystyle T=\lbrace \forall x \forall y \forall z \left((x\cdot y)\cdot z=x\cdot (y\cdot z)\right) \rbrace.$
Then it is easy to see that any model of $ T$ is a semigroup, and vice versa.

Next, let $ \tau'=\tau\cup \lbrace e\rbrace$, where $ e$ is a constant symbol, and

$\displaystyle T'=T\cup \lbrace \forall x (x\cdot e=x), \forall x\exists y (x\cdot y=e)\rbrace.$
Then $ G$ is a model of $ T'$ iff $ G$ is a group. Clearly any group is a model of $ T'$. To see the converse, let $ G$ be a model of $ T'$ and let $ 1\in G$ be the interpretation of $ e\in \tau'$ and $ \cdot:G\times G\to G$ be the interpretation of $ \cdot\in \tau'$. Let us write $ xy$ for the product $ x\cdot y$. For any $ x\in G$, let $ y\in G$ such that $ xy=1$ and $ z\in G$ such that $ yz=1$. Then $ 1z=(xy)z=x(yz)=x1=x$, so that $ 1x=1(1z)=(1\cdot 1)z=1z=x$. This shows that $ 1$ is the identity of $ G$ with respect to $ \cdot$. In particular, $ x=1z=z$, which implies $ 1=yz=yx$, or that $ y$ is a inverse of $ x$ with respect to $ \cdot$.

Remark. Let $ T$ be a theory. A class of $ \tau$-structures is said to be axiomatized by $ T$ if it is the class of all models of $ T$. $ T$ is said to be the set of axioms for this class. This class is necessarily unique, and is denoted by $ \operatorname{Mod}(T)$. When $ T$ consists of a single sentence $ \varphi$, we write $ \operatorname{Mod}(\varphi)$.



Anyone with an account can edit this entry. Please help improve it!

"model" is owned by CWoo. [ full author list (4) | owner history (3) ]
(view preamble)

View style:

See Also: satisfaction relation

Other names:  structure, $L$-structure
Also defines:  model
Keywords:  $L$-structure
Log in to rate this entry.
(view current ratings)

Cross-references: axioms, class, inverse, implies, identity, product, interpretation, converse, group, iff, constant symbol, semigroup, easy to see, variables, binary operation, theory, satisfies, satisfaction relation, sentence, signature
There are 3 references to this entry.

This is version 27 of model, born on 2002-08-28, modified 2007-11-27.
Object id is 3384, canonical name is Model.
Accessed 18038 times total.

Classification:
AMS MSC03C95 (Mathematical logic and foundations :: Model theory :: Abstract model theory)

Pending Errata and Addenda
None.
[ View all 7 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)