Abstract
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some surjection having the poset as domain. We then obtain combinatorial characterisations of such notions in terms of blocks, without reference to surjection. Finally, we give a further, equivalent definition of each kind of partition by means of analogues of equivalence relations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adámek, J., Herrlich, H., Strecker, G. E. (2004), Abstract and Concrete Categories - The Joy of Cats, electronic edition.
Chagrov, A., Zakharyaschev, M. (1997), Modal logic, (Oxford Logic Guides, 35), Oxford, Clarendon.
Codara, P. (2008), A theory of partitions of partially ordered sets. Ph.D. Diss., Milan, Università degli Studi di Milano.
Codara, P., D’Antona, O., Marra, V. (2009), Open Partitions and Probability Assignments in Gödel Logic, in ECSQARU 2009, LNCS (LNAI), in press.
Davey, B. A., Priestley, H. A. (2002), Introduction to Lattices and Order, 2nd ed., Cambridge, Cambridge University Press.
Johnstone, P. T. (1982), Stone Spaces, (Cambridge Studies in Advanced Mathematics, 3), Cambridge, Cambridge University Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Codara, P. (2009). Partitions of a Finite Partially Ordered Set. In: Damiani, E., D’Antona, O., Marra, V., Palombi, F. (eds) From Combinatorics to Philosophy. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88753-1_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-88753-1_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-88752-4
Online ISBN: 978-0-387-88753-1
eBook Packages: Computer ScienceComputer Science (R0)