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

The Computational Complexity of Logical Theories

  • Book
  • © 1979

Overview

Authors:
  1. Jeanne Ferrante
    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Charles W. Rackoff
    View author publications

    You can also search for this author in PubMed   Google Scholar

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 book

Log in via an institution

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

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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (9 chapters)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Introduction and background

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 1-27

  3. Ehrenfeucht games and decision procedures

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 28-46

  4. Integer addition — An example of an Ehrenfeucht game decision procedure

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 47-54

  5. Some additional upper bounds

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 55-127

  6. Direct products of theories

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 128-147

  7. Lower bound preliminaries

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 148-152

  8. A technique for writing short formulas defining complicated properties

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 153-161

  9. A lower bound on the theories of pairing functions

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 162-186

  10. Some additional lower bounds

    • Jeanne Ferrante, Charles W. Rackoff
    Pages 187-233

  11. Back Matter

    Pages 234-243
    Download chapter PDF
Back to top

Bibliographic Information

  • Book Title: The Computational Complexity of Logical Theories

  • Authors: Jeanne Ferrante, Charles W. Rackoff

  • Series Title: Lecture Notes in Mathematics

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1979

  • Softcover ISBN: 978-3-540-09501-9Published: 01 July 1979

  • eBook ISBN: 978-3-540-35197-9Published: 15 November 2006

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: XII, 244

  • Topics: Mathematics, general

Publish with us

Policies and ethics

Back to top

Search

Navigation