Counting Finite Residuated Lattices

DOI10.1007/978-3-540-72950-1_46MaRDI QIDQ5432291zbMATH OpenOpenAlexFDO

Authors Radim Belohlavek, Vilem Vychodil

Publication date 2 January 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72950-1_46

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Ordered semigroups and monoids (06F05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Counting finite lattices.
• Residuated Lattices
• scientific article; zbMATH DE number 653240
• Counting lattice points by means of the residue theorem
• Counting co-cyclic lattices
• Classes of residuated lattices
• Countable homogeneous lattices
• Counting non-uniform lattices
• Residuation in modular lattices and posets

Cited in

(7)

• Counting finite lattices.
• Countable homogeneous lattices
• The variety of residuated lattices is generated by its finite simple members
• scientific article; zbMATH DE number 653240 (Why is no real title available?)
• Fundamental residuated lattices.
• On the enumeration of finite 𝐿-algebras
• Residuated lattices of size \(\leq 12\)

This page was built for publication: Counting Finite Residuated Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432291)