Mathematical Structures: Multiplicative additive linear logic algebras

[Home]Multiplicative additive linear logic algebras

HomePage | RecentChanges | Login

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

Changed: 28,30c28,29
\Large Name of class
\quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Template}{edit}
% Note: replace "Template" with Name_of_class in previous line
\Large Multiplicative additive linear logic algebras
\quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Multiplicative_additive_linear_logic_algebras}{edit}

Changed: 32c31
\abbreviation{Abbr}
\abbreviation{MALLA}

Changed: 35,36c34,39
A ... is a structure $\mathbf{A}=\langle A,...\rangle$ of type $\langle
...\rangle$ such that
A multiplicative additive linear logic algebra is a structure $\mathbf{A}=\langle A,\vee,\bot,\wedge,\top,+,0,\cdot,1,^\perp\rangle$ of type $\langle
2,0,2,0,2,0,1\rangle$ such that

$\langle A,\vee,\wedge,\cdot,1,^{\perp}\rangle$ is a \href{Commutative_involutive_residuated_lattices.pdf}{commutative involutive residuated lattice}

$\bot$ is the least element: $\bot\le x$

Changed: 38c41
$\langle A,...\rangle$ is a \href{Name_of_class.pdf}{name of class}
$\top$ is the greatest element: $x\le\top$

Changed: 40c43
$op_1$ is (name of property): $axiom_1$
$+$ is the dual of $\cdot$: $x+y=(x^\perp\cdot y^\perp)^\perp$

Changed: 42c45
$op_2$ is ...: $...$
$0$ is the dual of $1$: $0=1^\perp$

Changed: 51,52c54
Let $\mathbf{A}$ and $\mathbf{B}$ be ... . A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a homomorphism:
$h(x ... y)=h(x) ... h(y)$
Let $\mathbf{A}$ and $\mathbf{B}$ be multiplicative additive linear logic algebras. A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a homomorphism.

Changed: 78,79c80,81
Classtype & (value, see description) \cite{Ln19xx} \\\hline
Equational theory & \\\hline
Classtype & variety \\\hline
Equational theory & decidable\\\hline

Changed: 84,88c86,90
Congruence distributive & \\\hline
Congruence modular & \\\hline
Congruence $n$-permutable & \\\hline
Congruence regular & \\\hline
Congruence uniform & \\\hline
Congruence distributive & yes\\\hline
Congruence modular & yes\\\hline
Congruence $n$-permutable & yes, $n=2$\\\hline
Congruence regular & no\\\hline
Congruence uniform & no\\\hline

http://mathcs.chapman.edu/structuresold/files/Multiplicative_additive_linear_logic_algebras.pdf
%%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}}
\hyperbaseurl{http://math.chapman.edu/structures/files/}
\pagestyle{myheadings}\thispagestyle{myheadings}
\markboth{\today}{math.chapman.edu/structures}

\begin{document}
\textbf{\Large Multiplicative additive linear logic algebras}
\quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Multiplicative_additive_linear_logic_algebras}{edit}

\abbreviation{MALLA}

\begin{definition}
A \emph{multiplicative additive linear logic algebra} is a structure $\mathbf{A}=\langle A,\vee,\bot,\wedge,\top,+,0,\cdot,1,^\perp\rangle$ of type $\langle
2,0,2,0,2,0,1\rangle$ such that

$\langle A,\vee,\wedge,\cdot,1,^{\perp}\rangle$ is a \href{Commutative_involutive_residuated_lattices.pdf}{commutative involutive residuated lattice}

$\bot$ is the least element:  $\bot\le x$

$\top$ is the greatest element:  $x\le\top$

$+$ is the dual of $\cdot$: $x+y=(x^\perp\cdot y^\perp)^\perp$

$0$ is the dual of $1$: $0=1^\perp$

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 multiplicative additive linear logic algebras. A morphism from $\mathbf{A}$ to $\mathbf{B}$ is a function $h:A\rightarrow B$ that is a homomorphism.
\end{morphisms}

\begin{definition}
An \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                       & variety \\\hline
  Equational theory               & decidable\\\hline
  Quasiequational theory          & \\\hline
  First-order theory              & \\\hline
  Locally finite                  & \\\hline
  Residual size                   & \\\hline
  Congruence distributive         & yes\\\hline
  Congruence modular              & yes\\\hline
  Congruence $n$-permutable       & yes, $n=2$\\\hline
  Congruence regular              & no\\\hline
  Congruence uniform              & no\\\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)= &\\
  f(3)= &\\
  f(4)= &\\
  f(5)= &\\
\end{array}$\qquad
$\begin{array}{lr}
  f(6)= &\\
  f(7)= &\\
  f(8)= &\\
  f(9)= &\\
  f(10)= &\\
\end{array}$

\end{finite_members}

\begin{subclasses}\ 

  \href{....pdf}{...} subvariety

  \href{....pdf}{...} expansion

\end{subclasses}

\begin{superclasses}\ 

  \href{....pdf}{...} supervariety

  \href{....pdf}{...} subreduct

\end{superclasses}

\begin{thebibliography}{10}

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

\end{thebibliography}

\end{document}
%


HomePage | RecentChanges | Login
This page is read-only | View other revisions
Last edited July 29, 2004 12:09 pm by Jipsen (diff)
Search: