Skip to main content
Log in

An equational theory for trilattices

  • Published:
algebra universalis Aims and scope Submit manuscript

Abstract.

This paper presents the new algebra of trilattices, which are understood as the triadic generalization of lattices. As with lattices, there is an order-theoretic and an algebraic approach to trilattices. Order-theoretically, a trilattice is defined as a triordered set in which six triadic operations of some small arity exist. The Reduction Theorem guarantees that then also all finitary operations exist in trilattices. Algebraically, trilattices can be characterized by nine types of trilattice equations. Apart from the idempotent, associative, and commutative laws, further types of identities are needed such as bounds and limits laws, antiordinal, absorption, and separation laws. The similarities and differences between ordered and triordered sets, lattices and trilattices are discussed and illustrated by examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received May 26, 1998; accepted in final form May 7, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Biedermann, K. An equational theory for trilattices. Algebra univers. 42, 253–268 (1999). https://doi.org/10.1007/s000120050002

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000120050002

Keywords

Navigation