Abstract
So far, we have freely used a luxury in mathematics that is so fundamental, we often take it for granted. In any proof, if one needs to work with an object that is known or assumed to exist, one says “let x be (the object in question)” and one moves on with the proof. No work is “wasted” on thinking about how to find the object. Indeed, especially in the finite setting it is obvious that given enough patience we should be able to find the object, provided it exists. Simply try out all possibilities and one of them will work. As long as one is not interested in the object itself, this approach is very efficient, especially in ruling out blind alleys.
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). Algorithmic Aspects. In: Ordered Sets. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0053-6_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0053-6_12
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