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...

Celý popis

Podrobná bibliografie

Vydáno v:	Order (Dordrecht) Ročník 42; číslo 3; s. 645 - 662
Hlavní autor:	Van Alten, C.J.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Dordrecht Springer Netherlands 01.12.2025 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!