ORDER ALGEBRAS

From MaRDI portal





The authors consider ordered sets with a greatest element. An algebra \({\mathcal P}= (P;\cdot,1)\) of type \((2,0)\) is called an order algebra if the following binary operation holds: If \(x\leq y\) then \(x\cdot y= 1\), and \(x\cdot y= y\) otherwise. Order algebras are connected with an implication modelling in intuitionistic logic. Theorem 1: The assigned order algebra \({\mathcal P}= (P;\cdot,1)\) is an implication algebra if and only if \((P;\leq)\) does not contain a chain of length \(n> 2\). Theorem 3: To every ideal \(I\) of \({\mathcal P}\) there exists a unique congruence \(\theta\in\text{Con\,}{\mathcal P}\) such that \([1]_\theta= I\). This congruence \(\theta\) is a Rees congruence. Theorem 4: Every order algebra is permutable, congruence distributive and weakly regular.











This page was built for publication: ORDER ALGEBRAS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531184)