[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A lower bound on the theories of pairing functions

  • Chapter
  • First Online:
The Computational Complexity of Logical Theories

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 718))

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag

About this chapter

Cite this chapter

Ferrante, J., Rackoff, C.W. (1979). A lower bound on the theories of pairing functions. In: The Computational Complexity of Logical Theories. Lecture Notes in Mathematics, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062845

Download citation

  • DOI: https://doi.org/10.1007/BFb0062845

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09501-9

  • Online ISBN: 978-3-540-35197-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics