Skip to main content
SpringerLink
Log in

Logical syntax and computational complexity

  • Conference paper
  • First Online:
Computation and Proof Theory

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

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
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.

References

  1. A. Adachi, S. Iwata, and T. Kasai, Low level complexity for combinatorial games, Proceedings of 13th SIGACT Symposium, 228–237.

    Google Scholar 

  2. S. A. Cook, The complexity of theorem-proving procedures, Proceedings, Third SIGACT Symposium, 151–178.

    Google Scholar 

  3. A. Chandra, H. R. Lewis, and J. Makowsky, Embedded implicational dependencies and their inference problem, JCSS, to appear.

    Google Scholar 

  4. L. Denenberg, Computational Complexity of Logical Problems: Formulas, Dependencies, and Circuits, PhD thesis, Harvard University, Division of Applied Sciences.

    Google Scholar 

  5. L. Denenberg and H. R. Lewis, The complexity of the satisfiability problem for Krom formulas, Theoretical Computer Science 30, to appear.

    Google Scholar 

  6. C. Dwork, P. Kanellakis, and J. Mitchell, On the sequential nature of unification, Journal of Logic Programming 1,1 (to appear).

    Google Scholar 

  7. M. Furer, Alternation and the Ackermann case of the decision problem, L'Enseignement Mathematique ser. II, XXVII, pp. 137–162.

    MathSciNet  Google Scholar 

  8. W. H. Joyner, Jr., Resolution strategies as decision procedures, JACM 23, 398–417.

    Article  MathSciNet  MATH  Google Scholar 

  9. N. D. Jones and W. T. Laaser, Complete problems for deterministic polynomial time, Theoretical Computer Science 3, 105–117.

    Article  MathSciNet  MATH  Google Scholar 

  10. N. D. Jones, Y. E. Lien, and W. T. Laaser, New problems complete for nondeterministic log space, Mathematical Systems Theory 10, 1–17.

    Article  MathSciNet  MATH  Google Scholar 

  11. H. R. Lewis, Complexity results for classes of quantificational formulas, JCSS 21, 317–353.

    MathSciNet  MATH  Google Scholar 

  12. J. F. Lynch, Complexity classes and theories of finite models, Mathematical Systems Theory, to appear.

    Google Scholar 

  13. H. R. Lewis and L. Denenberg, A hard problem for NTIME(nd), Proceedings, 19th Allerton Conference on Control, Communication, and Computing.

    Google Scholar 

  14. H. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall Publishing Company.

    Google Scholar 

  15. S. Ju. Maslov, An inverse method of establishing deducibilities in the classical predicate calculus, Soviet Mathematics Doklady 5, 1420–1424.

    MATH  Google Scholar 

  16. D. A. Plaisted, Complete problems in the first-order predicate calculus, manuscript.

    Google Scholar 

  17. W. J. Savitch, Relations between deterministic and nondeterministic tape complexities, JCSS 7, pp. 177–192..

    MATH  Google Scholar 

  18. E. Y. Shapiro, Alternation and the computational complexity of logic programs, Proceedings of First International Logic Programming Conference, 154–163.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aiken Computation Laboratory, Harvard University, 02138, Cambridge, MA, USA

    Larry Denenberg & Harry R. Lewis

Authors
  1. Larry Denenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harry R. Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Walter Oberschelp Michael M. Richter Brigitta Schinzel Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Denenberg, L., Lewis, H.R. (1984). Logical syntax and computational complexity. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099481

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13901-0

  • Online ISBN: 978-3-540-39119-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation