Abstract
One of the most natural questions to ask in any discrete setting is “How many of these objects are there?” Dedekind’s problem (Open Question 2.6.1) is such a question. A counting question can be motivated by pure curiosity or, as the Kelly Lemma (cf. Proposition 1.5.14) in reconstruction shows, it can be asked as a step in proving something else. The two most natural counting questions for ordered sets are still unanswered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Schröder, B.S.W. (2003). Enumeration. In: Ordered Sets. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0053-6_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0053-6_11
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6591-7
Online ISBN: 978-1-4612-0053-6
eBook Packages: Springer Book Archive