Commutative Doubly-Idempotent Semirings Determined by Chains and by Preorder Forests

DOI10.1007/978-3-030-43520-2_1OpenAlexW3013641259MaRDI QIDQ5098709

Peter Jipsen, Natanael Alpay

Publication date: 30 August 2022

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1051&context=scs_books

zbMATH Keywords

distributive latticesidempotent semiringspreorder forests

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Varieties of unary-determined distributive $\ell$-magmas and bunched implication algebras ⋮ The structure of locally integral involutive po-monoids and semirings ⋮ Unary-determined distributive \(\ell \)-magmas and bunched implication algebras ⋮ Isolated sublattices and their application to counting closure operators

Uses Software

• Prover9
• Mace4
• OEIS

Cites Work

• Unnamed Item
• Minimal varieties of semirings
• The variety of commutative additively and multiplicatively idempotent semirings
• Structure theorems for idempotent residuated lattices
• Commutative idempotent residuated lattices
• Some Varieties Containing Relation Algebras
• Boolean Algebras with Operators

This page was built for publication: Commutative Doubly-Idempotent Semirings Determined by Chains and by Preorder Forests