Skip to main content

Sam Buss: Bounded Logic

  • Chapter
People, Problems, and Proofs

Abstract

This chapter presents a lesser-known limitation of first-order logic. Lipton had the experience of sitting on a potential breakthrough in complexity theory if only he could encode a certain construction in first-order logic. He approached Buss, who used his background in bounded logic to recognize it as a known impossibility.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 49.99
Price excludes VAT (USA)
  • Durable hardcover 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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Lipton, R.J., Regan, K.W. (2013). Sam Buss: Bounded Logic. In: People, Problems, and Proofs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41422-0_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41422-0_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41421-3

  • Online ISBN: 978-3-642-41422-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics