Skip to main content

Algorithmic Aspects

  • Chapter
Ordered Sets
  • 582 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics