A characterization of completeness for trellises
type: Item
instance of: scholarly article
title: A characterization of completeness for trellises
zbMATH Open document ID: 1013.06003
author: S. Parameshwara Bhatta
author: H. Shashirekha
published in: Algebra Universalis
publication date: 2003-04-23T00:00:00Z
review text: A trellis is defined as a pseudo-ordered set any two of whose elements have a GLB and LUB (a pseudo-order is a reflexive and antisymmetric binary relation). Main result: A trellis \(A\) is complete (i.e. every subset of \(A\) has a GLB and a LUB) if and only if every ascending well-ordered \(p\)-chain in \(A\) has a join.
reviewed by: Ivan Chajda
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 06B23
zbMATH DE Number: 1899969
zbMATH Keywords: pseudo-order
zbMATH Keywords: trellis
zbMATH Keywords: complete trellis
MaRDI profile type: Publication
full work available at URL: s000120050189
OpenAlex ID: W1993332859
DOI: 10.1007/S000120050189
description: scientific article; zbMATH DE number 1899969