Mathematical Structures: Kleene lattices

# Kleene lattices

HomePage | RecentChanges | Login

Difference (from prior major revision) (no other diffs)

 %%run pdflatex

Changed: 2,116c3,115
 %%run pdflatex % \documentclass[12pt]{amsart} \usepackage[pdfpagemode=Fullscreen,pdfstartview=FitBH]{hyperref} \parindent=0pt \parskip=5pt \addtolength{\oddsidemargin}{-.5in} \addtolength{\evensidemargin}{-.5in} \addtolength{\textwidth}{1in} \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}} \pagestyle{myheadings}\thispagestyle{myheadings} \markboth{\today}{math.chapman.edu/structures} \begin{document} \textbf{\Large Kleene lattices} \quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Kleene_lattices}{edit} \abbreviation{KLat} \begin{definition} A \emph{Kleene lattice} is a structure $\mathbf{A}=\left\langle A,\vee ,\wedge ,0,\cdot ,1,^{\ast }\right\rangle$ of type $\left\langle 2,2,0,2,0,1\right\rangle$ such that $\left\langle A,\vee ,0,\cdot ,1,^{\ast }\right\rangle$ is a Kleene algebra $\left\langle A,\vee ,\wedge \right\rangle$ is a lattice \end{definition} \begin{morphisms} Let $\mathbf{A}$ and $\mathbf{B}$ be Kleene lattices. A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a homomorphism: $h(x\vee y)=h(x)\vee h(y)$, $h(x\wedge y)=h(x)\wedge h(y)\ \mbox{and} h(x\cdot y)=h(x)\cdot h(y)$, $h(x^{\ast })=h(x)^{\ast }$, $h(0)=0$, $h(1)=1$ \end{morphisms} \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}) \begin{tabular}{|ll|}\hline Classtype & Quasivariety\\\hline Equational theory & \\\hline Quasiequational theory & Undecidable\\\hline First-order theory & Undecidable\\\hline Locally finite & No\\\hline Residual size & Unbounded\\\hline Congruence distributive & Yes\\\hline Congruence modular & Yes\\\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)= &16\\ f(5)= &149\\ f(6)= &1488\\ \end{array}$ \end{finite_members} \hyperbaseurl{http://math.chapman.edu/structures/files/} \parskip0pt \begin{subclasses}\ \href{Action_lattices.pdf}{Action lattices} \end{subclasses} \begin{superclasses}\ \href{Kleene_algebras.pdf}{Kleene algebras} \href{Multiplicative_lattices.pdf}{Multiplicative lattices} \end{superclasses} \begin{thebibliography}{10} \bibitem{Ln19xx} \end{thebibliography} \end{document} %
 % \documentclass[12pt]{amsart} \usepackage[pdfpagemode=Fullscreen,pdfstartview=FitBH]{hyperref} \parindent=0pt \parskip=5pt \addtolength{\oddsidemargin}{-.5in} \addtolength{\evensidemargin}{-.5in} \addtolength{\textwidth}{1in} \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}} \pagestyle{myheadings}\thispagestyle{myheadings} \markboth{\today}{math.chapman.edu/structures} \begin{document} \textbf{\Large Kleene lattices} \quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Kleene_lattices}{edit} \abbreviation{KLat} \begin{definition} A \emph{Kleene lattice} is a structure $\mathbf{A}=\left\langle A,\vee ,\wedge ,0,\cdot ,1,^{\ast }\right\rangle$ of type $\left\langle 2,2,0,2,0,1\right\rangle$ such that $\left\langle A,\vee ,0,\cdot ,1,^{\ast }\right\rangle$ is a Kleene algebra $\left\langle A,\vee ,\wedge \right\rangle$ is a lattice \end{definition} \begin{morphisms} Let $\mathbf{A}$ and $\mathbf{B}$ be Kleene lattices. A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a homomorphism: $h(x\vee y)=h(x)\vee h(y)$, $h(x\wedge y)=h(x)\wedge h(y)\ \mbox{and} h(x\cdot y)=h(x)\cdot h(y)$, $h(x^{\ast })=h(x)^{\ast }$, $h(0)=0$, $h(1)=1$ \end{morphisms} \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}) \begin{tabular}{|ll|}\hline Classtype & Quasivariety\\\hline Equational theory & \\\hline Quasiequational theory & Undecidable\\\hline First-order theory & Undecidable\\\hline Locally finite & No\\\hline Residual size & Unbounded\\\hline Congruence distributive & Yes\\\hline Congruence modular & Yes\\\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)= &16\\ f(5)= &149\\ f(6)= &1488\\ \end{array}$ \end{finite_members} \hyperbaseurl{http://math.chapman.edu/structures/files/} \parskip0pt \begin{subclasses}\ \href{Action_lattices.pdf}{Action lattices} \end{subclasses} \begin{superclasses}\ \href{Kleene_algebras.pdf}{Kleene algebras} \href{Multiplicative_lattices.pdf}{Multiplicative lattices} \end{superclasses} \begin{thebibliography}{10} \bibitem{Ln19xx} \end{thebibliography} \end{document} %

http://mathcs.chapman.edu/structuresold/files/Kleene_lattices.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}}
\markboth{\today}{math.chapman.edu/structures}

\begin{document}
\textbf{\Large Kleene lattices}

\abbreviation{KLat}
\begin{definition}
A \emph{Kleene lattice} is a structure $\mathbf{A}=\left\langle A,\vee ,\wedge ,0,\cdot ,1,^{\ast }\right\rangle$ of type $\left\langle 2,2,0,2,0,1\right\rangle$ such that

$\left\langle A,\vee ,0,\cdot ,1,^{\ast }\right\rangle$ is a Kleene algebra

$\left\langle A,\vee ,\wedge \right\rangle$ is a lattice

\end{definition}
\begin{morphisms}
Let $\mathbf{A}$ and $\mathbf{B}$ be Kleene lattices. A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a
homomorphism:

$h(x\vee y)=h(x)\vee h(y)$, $h(x\wedge y)=h(x)\wedge h(y)\ \mbox{and} h(x\cdot y)=h(x)\cdot h(y)$, $h(x^{\ast })=h(x)^{\ast }$, $h(0)=0$, $h(1)=1$

\end{morphisms}
\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})

\begin{tabular}{|ll|}\hline
Classtype & Quasivariety\\\hline
Equational theory & \\\hline
Quasiequational theory & Undecidable\\\hline
First-order theory & Undecidable\\\hline
Locally finite & No\\\hline
Residual size & Unbounded\\\hline
Congruence distributive & Yes\\\hline
Congruence modular & Yes\\\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)= &16\\ f(5)= &149\\ f(6)= &1488\\ \end{array}$
\end{finite_members}
\hyperbaseurl{http://math.chapman.edu/structures/files/}
\parskip0pt
\begin{subclasses}\

\href{Action_lattices.pdf}{Action lattices}

\end{subclasses}
\begin{superclasses}\

\href{Kleene_algebras.pdf}{Kleene algebras}

\href{Multiplicative_lattices.pdf}{Multiplicative lattices}

\end{superclasses}

\begin{thebibliography}{10}

\bibitem{Ln19xx}

\end{thebibliography}

\end{document}
%

HomePage | RecentChanges | Login