Lattices freely generated by posets within a variety. Part I: Four easy varieties
msra(2010)
摘要
We introduce an algorithm for computing closure systems derived from a family
of implications on a set. Semilattices presentations are explored and used in
conjunction with the algorithm to compute various types of lattices freely
generated by partially ordered sets within four easy varieties.
更多查看译文
关键词
partially ordered set
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要