Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Algebraic and graph-theoretic properties of infinite n -posets

Zoltán ÉsikZoltán L. Németh — 2005

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A Σ -labeled n -poset is an (at most) countable set, labeled in the set Σ , equipped with n partial orders. The collection of all Σ -labeled n -posets is naturally equipped with n binary product operations and n ω -ary product operations. Moreover, the ω -ary product operations give rise to n ω -power operations. We show that those Σ -labeled n -posets that can be generated from the singletons by the binary and ω -ary product operations form the free algebra on Σ in a variety...

Algebraic and graph-theoretic properties of infinite -posets

Zoltán ÉsikZoltán L. Németh — 2010

RAIRO - Theoretical Informatics and Applications

A -labeled -poset is an (at most) countable set, labeled in the set , equipped with partial orders. The collection of all -labeled -posets is naturally equipped with binary product operations and -ary product operations. Moreover, the -ary product operations give rise to -power operations. We show that those -labeled -posets that can be generated from the singletons by the binary and -ary product operations form the free algebra on in a variety axiomatizable by...

Page 1

Download Results (CSV)