Completion and finite embeddability property for residuated ordered algebras.
type: Item
instance of: scholarly article
title: Completion and finite embeddability property for residuated ordered algebras.
zbMATH Open document ID: 1214.06006
published in: Algebra Universalis
publication date: 2010-09-10T00:00:00Z
review text: This is a long, well-written and very interesting paper. A residuated ordered algebra (of type \(T\)) (roa, for short) is a structure \({\mathbf A}=\langle A, T, \leq\rangle\), where \(\langle A, \leq\rangle\) is a partially ordered set and \(\langle A,T\rangle\) is an algebra whose language \(T\) is a finite set consisting of a set \(T_0\) of constants, sets \(T_1\) and \(T_2\) of unary and binary residuated operations, respectively, and the sets of their residuals, \(T_1^*\) and \(T_2^*\), respectively. Hence \(T = T_0 \cup T_1 \cup T_2 \cup T_1^* \cup T_2^*\). For instance, a commutative residuated lattice \((A, \wedge, \vee, \circ, \rightarrow,1)\) is such an roa with \(T_0=\{1\}\), \(T_1= T_1^*= \emptyset\), \(T_2=\{ \circ \}\), \(T_2^*=\{\rightarrow \}\), with the partial order \(\leq\) being a lattice order with lattice operations \(\wedge\) and \(\vee\). The paper mainly presents the construction of a structure \({\mathbf F}=\langle F, T^F, \leq^F\rangle\), starting with a fixed roa \({\mathbf A}=\langle A, T, \leq\rangle\), a fixed partial (ordered) subalgebra \({\mathbf B}=\langle B, T^B, \leq^B\rangle\) of \({\mathbf A}\) and a fixed \({\mathbf B}\)-residual pair \({\mathbf M}=\langle M,M^*\rangle\), where \(F\) is the set of all stable sets \(X \subseteq M^*\) (i.e., verifying \(X^{lu}=X\)). The main result is Theorem 5.11, saying that \({\mathbf F}\) is a complete roa of the same type as \({\mathbf A}\), and there exists an embedding of \({\mathbf B}\) into \({\mathbf F}\) preserving all existing meets and joins in \({\mathbf B}\). The author then studies: which properties of \({\mathbf A}\) are preserved by \({\mathbf F}\); the conditions under which \({\mathbf F}\) is finite; the class of residuated ordered semigroups in which \(T_1=\emptyset\); the class of descending roas; the class of unary roas; the class of involutive residuated ordered semigroups; the class of roas satisfying an inequality \(s \leq t\). Finally, he proves that for commutative re…
reviewed by: Afrodita Iorgulescu
Mathematics Subject Classification ID: 06F25
Mathematics Subject Classification ID: 06B23
Mathematics Subject Classification ID: 06F05
zbMATH DE Number: 5782716
zbMATH Keywords: residuated ordered algebra
zbMATH Keywords: residuated lattice
zbMATH Keywords: finite embeddability property
zbMATH Keywords: complete lattice
zbMATH Keywords: MacNeille completion
zbMATH Keywords: well-quasi-ordering
author: C. J. van Alten
MaRDI profile type: Publication
full work available at URL: s00012-010-0060-9
OpenAlex ID: W2135967889
cites work: The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
cites work: On the finite embeddability property for residuated ordered groupoids
cites work: Q4056047
cites work: Non-Commutative Residuated Lattices
cites work: Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
cites work: Q5509706
cites work: Residuated lattices. An algebraic glimpse at substructural logics
cites work: Residuated frames with applications to decidability
cites work: Cut elimination and strong separation for substructural logics: an algebraic approach
cites work: MacNeille completions and canonical extensions
cites work: The preservation of Sahlqvist equations in completions of Boolean algebras with operators
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Q5693612
cites work: On the canonicity of Sahlqvist identities
cites work: Fuzzy logics from substructural perspective
cites work: Partially Ordered Sets
cites work: Which structural rules admit cut elimination? An algebraic criterion
cites work: The finite model property for knotted extensions of propositional linear logic
cites work: Implicational subreducts of \(n\)-potent commutative residuated lattices
cites work: Rule separation and embedding theorems for logics without weakening
cites work: Residuated Lattices
DOI: 10.1007/S00012-010-0060-9
description: scientific article; zbMATH DE number 5782716