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

Uložené v:
Podrobná bibliografia
Vydané v:Order (Dordrecht) Ročník 42; číslo 3; s. 645 - 662
Hlavný autor: Van Alten, C.J.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Netherlands 01.12.2025
Springer Nature B.V
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 shown to be decidable in O ( n 3 ) time. Explicit algorithms are given for deciding the above equational theories. These algorithms use a dynamic programming approach and are based on a sequent calculus that extends Whitman’s sequent calculus for lattices.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0167-8094
1572-9273
DOI:10.1007/s11083-025-09701-4