|
|
|
Viewing Version
21
of
'first order language'
|
[ view 'first order language'
|
back to history
]
| Title of object: |
first order language |
| Canonical Name: |
TermsAndFormulas |
| Type: |
Definition |
| Created on: |
2002-06-02 11:03:52 |
| Modified on: |
2007-11-27 16:07:40 |
| Classification: |
msc:03B10, msc:03C07 |
| Defines: |
first order language, term, formula |
| Synonyms: |
first order language=auxiliary symbol
first order language=first-order language |
Preamble:
% this is the default PlanetMath preamble. as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.
% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
\usepackage[arrow,curve,poly,arc,2cell,frame,web]{xypic}
% there are many more packages, add them here as you need them
% define commands here
\newcommand{\br}{[\![}
\newcommand{\rb}{]\!]}
\newcommand{\oq}{\text{``}}
\newcommand{\cq}{\text{''}}
\newcommand{\im}{\mathbf{Im}}
\newcommand{\dom}{\mathbf{Dom}}
\newcommand{\Or}{\vee}
\newcommand{\Implies}{\Rightarrow}
\newcommand{\Iff}{\Leftrightarrow}
\newcommand{\proves}{\vdash}
\renewcommand{\And}{\wedge}
\newcommand{\Sup}{\bigwedge}
\newcommand{\Inf}{\bigvee}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\F}{\mathbb{F}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\Nat}{\mathbb{N}}
\newcommand{\M}{\mathfrak{M}}
\newcommand{\N}{\mathfrak{N}}
\newcommand{\A}{\mathfrak{A}}
\newcommand{\B}{\mathfrak{B}}
\newcommand{\K}{\mathfrak{K}}
\newcommand{\G}{\mathbb{G}}
\newcommand{\Def}{\overset{\operatorname{def}}{:=}}
\newcommand{\spec}{\text{{\bf Spec}}}
\newcommand{\stab}{\text{{\bf Stab}}}
\newcommand{\ann}{\text{{\bf Ann}}}
\newcommand{\irr}{\text{{\bf Irr}}}
\newcommand{\qt}{\text{{\bf Qt}}}
\newcommand{\st}{\mathcal{Qt}}
\newcommand{\ro}{\mathbf{r.o.}}
\newcommand{\Endo}{\text{{\bf End}}}
\newcommand{\mat}{\text{{\bf Mat}}}
\newcommand{\der}{\text{{\bf Der}}}
\newcommand{\rad}{\text{{\bf Rad}}}
\newcommand{\trd}{\text{{\bf tr.d.}}}
\newcommand{\cl}{\text{{\bf acl}}}
\newcommand{\Int}{\text{{\bf int}}}
\newcommand{\V}{\mathbb{V}}
\newcommand{\D}{\mathbf{D}}
\newcommand{\del}{\partial}
\renewcommand{\O}{\mathcal{O}}
\newcommand{\aut}{\mathbf{Aut}}
\newcommand{\height}{\text{\bf Height}}
\newcommand{\coheight}{\text{\bf Co-height}}
\newcommand{\lcm}{\operatorname{lcm}}
\newcommand{\Gal}{\operatorname{Gal}}
\newcommand{\x}{\mathbf{x}}
\newcommand{\y}{\mathbf{y}}
\newcommand{\inner}[2]{\langle #1|#2\rangle}
\renewcommand{\r}{{r}}
\renewcommand{\t}{{t}}
\newcommand{\restr}{\upharpoonright}
\newcommand{\Matrix}[4]{\left(\begin{array}{cc} #1 & #2 \\ #3 & #4
\end{array}\right)} |
Content:
Let $\Sigma$ be a signature. The \emph{first order language} $\operatorname{FO}(\Sigma)$ on $\Sigma$ contains the following:
\begin{enumerate}
\item the set $S(\Sigma)$ of \emph{symbols} of $\operatorname{FO}(\Sigma)$, which is the disjoint union of the following sets:
\begin{enumerate}
\item $\Sigma$ (the \emph{non-logical symbols}),
\item a countably infinite set $V$ of variables,
\item the set of logical symbols $\lbrace \And, \Or, \neg, \Implies, \Iff, \forall, \exists \rbrace$,
\item the singleton consisting of the equality symbol $\lbrace =\rbrace$, and
\item the set of parentheses (left and right) $\lbrace (, )\rbrace$;
\end{enumerate}
\item the set $T(\Sigma)$ of \emph{terms} of $\operatorname{FO}(\Sigma)$, which is built inductively from $S(\Sigma)$, as follows:
\begin{enumerate}
\item Any variable $v\in V$ is a term;
\item Any constant symbol in $\Sigma$ is a term;
\item If $f$ is an $n$-ary function symbol in $\Sigma$, and $t_1,...,t_n$ are
terms, then $f(t_1,...,t_n)$ is a term.
\end{enumerate}
\item the set $F(\Sigma)$ of \emph{formulas} of $\operatorname{FO}(\Sigma)$, which is built inductively from $T(\Sigma)$, as follows:
\begin{enumerate}
\item If $t_1$ and $t_2$ are terms, then $(t_1=t_2)$ is a formula;
\item If $R$ is an $n$-ary relation symbol and $t_1,...,t_n$ are
terms, then $(R(t_1,...,t_n))$ is a formula;
\item If $\varphi$ is a formula, then so is $(\neg\varphi)$;
\item If $\varphi$ and $\psi$ are formulas, then so is $(\varphi\Or\psi)$;
\item If $\varphi$ is a formula, and $x$ is a variable, then $(\exists x(\varphi))$ is a formula.
\end{enumerate}
\end{enumerate}
In other words, $T(\Sigma)$ and $F(\Sigma)$ are the smallest sets, among all sets satisfying the conditions given for terms and formulas, respectively.
For example, in the first order language of partially ordered rings, expressions such as
$$0,\quad x^2,\quad\mbox{ and } \quad y+zx$$ are terms, while
$$(x=xy),\quad (x+y \le yz),\quad \mbox{ and }\quad (\exists x ((x\le 0) \Or (0\le x)))$$ are formulas.
\textbf{Remarks}.
\begin{enumerate}
\item
Generally, one omits parentheses in formulas, when there is no ambiguity. For example, a formula $(\varphi)$ can be simply written $\varphi$. As such, the parentheses are also called the \emph{auxiliary symbols}.
\item
The first two types of formulas, not involving logical connectives, are the \emph{atomic formulas}. It is evident that formulas are inductively built from atomic formulas.
\item
The other logical symbols are obtained in the following way :
\begin{alignat*}
\varphi\varphi\And\psi&\Def\neg(\neg\varphi\Or\neg\psi)&\qquad
\varphi\Implies\psi&\Def\neg\varphi\Or\psi\\
\varphi\Iff\psi&\Def(\varphi\Implies\psi)\And(\psi\Implies\varphi)&\qquad
\forall x(\varphi)&\Def\neg(\exists x(\neg\varphi))
\end{alignat*}
All logical symbols are used when building formulas.
\item
In the literature, it is a common practice to write $\Sigma_{\omega \omega}$ for $\operatorname{FO}(\Sigma)$. The first subscript means that every formula in $\operatorname{FO}(\Sigma)$ contains a finite number of $\vee$'s (less than $\omega$), while the second subscript signifies that every formula has a finite number of $\exists$'s. In general, $\Sigma_{\alpha\beta}$ denotes a language built from $\Sigma$ such that, in any given formula, the number of occurrences of $\vee$ is less than $\alpha$ and the number of occurrences of $\exists$ is less than $\beta$. Clearly, if $\alpha$ and $\beta$ are not $\omega$, we get a language that is not first-order.
\item
Also a common practice in the literature, $\Sigma$ is used to identify a signature and the first-order language it uniquely determines.
\end{enumerate}
\begin{thebibliography}{99}
\bibitem{H}
W.~Hodges, {\it A Shorter Model Theory}, Cambridge University Press, (1997).
\bibitem{M}
D.~Marker, {\it Model Theory, An Introduction}, Springer, (2002).
\end{thebibliography} |
|
|
|
|
|
