Polynomial-time Equational Theory for Lattices with Unary Operators

The equational theory of the class of lattices with a pair of unary residuated operations is shown to be decidable in O ( n 5 ) time. The same complexity holds in the bounded case. The equational theory of the class of lattices, as well as the class of bounded lattices, with a unary operator is show...

Full description

Bibliographic Details

Published in:	Order (Dordrecht) Vol. 42; no. 3; pp. 645 - 662
Main Author:	Van Alten, C.J.
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.12.2025 Springer Nature B.V
Subjects:	Algebra Algorithms Calculus Discrete Mathematics Dynamic programming Lattices Mathematics Mathematics and Statistics Order Ordered Algebraic Structures Polynomials Lattice with operator Polynomial-time algorithm Unary residuated lattice Equational theory
ISSN:	0167-8094, 1572-9273
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!