Mathematical Structures: Ordered monoids with zero

# Ordered monoids with zero

http://mathcs.chapman.edu/structuresold/files/Ordered_monoids_with_zero.pdf
%%run pdflatex

%


\documentclass[12pt]{amsart}
\usepackage[pdfpagemode=Fullscreen,pdfstartview=FitBH]{hyperref}
\parindent=0pt
\parskip=5pt
\theoremstyle{definition}
\newtheorem{definition}{Definition}
\newtheorem*{morphisms}{Morphisms}
\newtheorem*{basic_results}{Basic Results}
\newtheorem*{examples}{Examples}
\newtheorem{example}{}
\newtheorem*{properties}{Properties}
\newtheorem*{finite_members}{Finite Members}
\newtheorem*{subclasses}{Subclasses}
\newtheorem*{superclasses}{Superclasses}
\newcommand{\abbreviation}[1]{\textbf{Abbreviation: #1}}
\hyperbaseurl{http://math.chapman.edu/structures/files/}
\markboth{\today}{math.chapman.edu/structures}

\begin{document}
\textbf{\Large Ordered monoids with zero}

\abbreviation{OMonZ}

\begin{definition}
An \emph{ordered monoid with zero} is of the form $\mathbf{A}=\langle A,\cdot,1,0,\le\rangle$ such that $\mathbf{A}=\langle A,\cdot,1,\le\rangle$ is an \href{Ordered_monoids.pdf}{ordered monoid} and

$0$ is a \emph{zero}:  $x\cdot 0 = 0$ and $0\cdot x = 0$

Remark: This is a template.
If you know something about this class, click on the Edit text of this page'' link at the bottom and fill out this page.

It is not unusual to give several (equivalent) definitions. Ideally, one of the definitions would give an irredundant axiomatization that does not refer to other classes.
\end{definition}

\begin{morphisms}
Let $\mathbf{A}$ and $\mathbf{B}$ be ordered monoids. A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a orderpreserving homomorphism:
$h(x \cdot y)=h(x) \cdot h(y)$,
$h(1)=1$,
$h(0)=0$,
$x\le y\implies h(x)\le h(y)$.
\end{morphisms}

\begin{definition}
A \emph{...} is a structure $\mathbf{A}=\langle A,...\rangle$ of type $\langle ...\rangle$ such that

$...$ is ...:  $axiom$

$...$ is ...:  $axiom$
\end{definition}

\begin{basic_results}
\end{basic_results}

\begin{examples}
\begin{example}
\end{example}
\end{examples}

\begin{table}[h]
\begin{properties} (\href{http://math.chapman.edu/cgi-bin/structures?Properties}{description})

Feel free to add or delete properties from this list. The list below may contain properties that are not relevant to the class that is being described.

\begin{tabular}{|ll|}\hline
Classtype                       & universal \\\hline
Equational theory               & \\\hline
Quasiequational theory          & \\\hline
First-order theory              & \\\hline
Locally finite                  & \\\hline
Residual size                   & \\\hline
Congruence distributive         & \\\hline
Congruence modular              & \\\hline
Congruence $n$-permutable       & \\\hline
Congruence regular              & \\\hline
Congruence uniform              & \\\hline
Congruence extension property   & \\\hline
Definable principal congruences & \\\hline
Equationally def. pr. cong.     & \\\hline
Amalgamation property           & \\\hline
Strong amalgamation property    & \\\hline
Epimorphisms are surjective     & \\\hline
\end{tabular}
\end{properties}
\end{table}

\begin{finite_members}
$f(n)=$ number of members of size $n$.

$\begin{array}{lr} f(1)= &1\\ f(2)= &1\\ f(3)= &3\\ f(4)= &15\\ f(5)= &84\\ f(6)= &575\\ f(7)= &4687\\ f(8)= &45223\\ f(9)= &\\ \end{array}$
\end{finite_members}

\begin{subclasses}\

\href{Commutative_ordered_monoids_with_zero.pdf}{Commutative ordered monoids}

\end{subclasses}

\begin{superclasses}\

\href{Ordered_monoids.pdf}{Ordered monoids} reduced type

\href{Ordered_semigroups_with_zero.pdf}{Ordered semigroups with zero} reduced type

\href{Representable_residuated_lattices.pdf}{Representable residuated lattices}

\end{superclasses}

\begin{thebibliography}{10}

\bibitem{Lastname19xx}
F. Lastname, \emph{Title}, Journal, \textbf{1}, 23--45 \href{http://www.ams.org/mathscinet-getitem?mr=12a:08034}{MRreview}

\end{thebibliography}

\end{document}
%