Mathematical Structures: Neardistributive lattices

# Neardistributive lattices

http://mathcs.chapman.edu/structuresold/files/Neardistributive_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 Neardistributive lattices}

\abbreviation{NdLat}
\begin{definition}
A \emph{neardistributive lattice} is a \href{Lattices.pdf}{Lattices} $\mathbf{L}=\langle L,\vee ,\wedge \rangle$ such that

SD$_{\wedge}^2$:  $x\wedge(y\vee z)=x\wedge[y\vee (x\wedge [z\vee(x\wedge y)])]$

SD$_{\vee}^2$:  $x\vee(y\wedge z)=x\vee[y\wedge (x\vee [z\wedge(x\vee y)])]$
\end{definition}

\begin{morphisms}
Let $\mathbf{L}$ and $\mathbf{M}$ be neardistributive lattices. A morphism from $\mathbf{L}$ to $\mathbf{M}$ is a function
$h:L\rightarrow M$ that is a homomorphism:

$h(x\vee y)=h(x)\vee h(y)$, $h(x\wedge y)=h(x)\wedge h(y)$
\end{morphisms}

\begin{basic_results}
\end{basic_results}
\begin{examples}
\begin{example}
$D[d]=\langle D\cup\{d'\},\vee ,\wedge\rangle$, where $D$ is any distributive lattice and $d$ is an element in it that
is split into two elements $d,d'$ using Alan Day's doubling construction.
\end{example}
\end{examples}
\begin{table}[h]
\begin{properties} (\href{http://math.chapman.edu/cgi-bin/structures?Properties}{description})

\begin{tabular}{|ll|}\hline
Classtype & variety\\\hline
Equational theory & \\\hline
Quasiequational theory & \\\hline
First-order theory & undecidable\\\hline
Congruence distributive & yes\\\hline
Congruence modular & yes\\\hline
Congruence n-permutable & no\\\hline
Congruence regular & no\\\hline
Congruence uniform & no\\\hline
Congruence extension property & \\\hline
Definable principal congruences & \\\hline
Equationally def. pr. cong. & \\\hline
Amalgamation property & no\\\hline
Strong amalgamation property & no\\\hline
Epimorphisms are surjective & \\\hline
Locally finite & no\\\hline
Residual size & unbounded\\\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)= &1\\ f(4)= &\\ f(5)= &\\ f(6)= &\\ f(7)= &\\ \end{array}$
\end{finite_members}
\hyperbaseurl{http://math.chapman.edu/structures/files/}
\parskip0pt
\begin{subclasses}\

\href{Almost_distributive_lattices.pdf}{Almost distributive lattices}

\end{subclasses}
\begin{superclasses}\

\href{Semidistributive_lattices.pdf}{Semidistributive lattices}

\end{superclasses}

\begin{thebibliography}{10}

\bibitem{Ln19xx}

\end{thebibliography}

\end{document}
%