Skip to main content
SpringerLink
Log in

Toward logic tailored for computational complexity

  • Conference paper
  • First Online:
Computation and Proof Theory

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

Abstract

Whereas first-order logic was developed to confront the infinite it is often used in computer science in such a way that infinite models are meaningless. We discuss the first-order theory of finite structures and alternatives to first-order logic, especially polynomial time logic.

Supported in part by NSF grant MCS83-01022

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.V. Aho and J.D. Ullman, "Universality of Data Retrieval Languages", Proc. of 6th ACM Symposium on Principles of Programming Languages, 1979, 110–117.

    Google Scholar 

  2. J. Bennet, "On Spectra", Doctoral Dissertation, Princeton University, N.J., 1962.

    Google Scholar 

  3. E. Börger, "Spektralproblem and Completeness of Logical Decision Problems", in "Logic and Machines: Decision Problems and Complexity (ed. E. Börger, G. Hasenjaeger, D. Rödding), Springer Lecture Notes in Computer Science, to appear.

    Google Scholar 

  4. A.K. Chandra and D. Harel, "Computable Queries for Relational Databases", Journal of Computer and System Sciences 21 (1980), 156–178.

    Article  MathSciNet  MATH  Google Scholar 

  5. A.K. Chandra and D. Harel, "Structure and Complexity of Relational Queries", Journal of Computer and System Sciences 25 (1982), 99–128.

    Article  MATH  Google Scholar 

  6. C.C. Chang and H.J. Keisler, "Model Theory", North-Holland, 1977.

    Google Scholar 

  7. A.K. Chandra, D.C. Kozen and L.J. Stockmeyer, "Alternation", Journal of the ACM 28 (1981), 114–133.

    Article  MathSciNet  MATH  Google Scholar 

  8. K. Compton, A private communication.

    Google Scholar 

  9. W. Craig, "Three Uses of the Herbrand-Gentzen Theorem in Relating Model Theory and Proof Theory", J. Symbolic Logic 22 (1957), 250–268.

    Article  MathSciNet  MATH  Google Scholar 

  10. A. Ehrenfeucht, "An Application of Games to the Completeness Problem for Formalized Theories", Fund. Math. 49 (1961), 129–141.

    MathSciNet  MATH  Google Scholar 

  11. R. Fagin, "Generalized First-Order Spectra and Polynomial-Time Recognizable Sets", in "Complexity of Computation" (ed. R. Karp), SIAM-AMS Proc. 7 (1974), 43–73.

    Google Scholar 

  12. R. Fagin, "Monadic generalized spectra", Zeitschr. f. math. Logik und Grundlagen d. Math. 21, 1975, 89–96.

    Article  MathSciNet  MATH  Google Scholar 

  13. H. Friedman, "The Complexity of Explicit Definitions", Advances in Mathematics 20 (1976), 18–29.

    Article  MathSciNet  MATH  Google Scholar 

  14. S. Feferman and R.L. Vaught, "The First-Order Properties of Algebraic Systems", Fund. Math. 47 (1959), 57–103.

    MathSciNet  MATH  Google Scholar 

  15. M.R. Garey and D.S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-completeness", Freeman, 1979.

    Google Scholar 

  16. Yu. V. Glebskii, D.I. Kogan, M.I. Liogon'kii and V.A. Talanov, "Range and Degree of Relizability of Formulas in the Restricted Predicate Calculus", Cybernetics 5:2 (1969), 17–28; translation (1972), 142–154.

    MathSciNet  Google Scholar 

  17. Y. Gurevich and H.R. Lewis, "A Logic for Constant-Depth Circults", Manuscript, 1983.

    Google Scholar 

  18. H. Gaifman and M.Y. Vardi, "A Simple Proof that Connectivity is not First-Order", Manuscript, 1983.

    Google Scholar 

  19. W. Goldfarb, "The Gödel Class with Identity is Unsolvable", Journal of Symbolic Logic, to appear.

    Google Scholar 

  20. Y. Gurevich, "Existential Interpretation", Algebra and Logic, 4:4 (1965), 71–85 (or "Existential Interpretation II", Archiv Math. Logik 22 (1982), 103–120).

    MathSciNet  MATH  Google Scholar 

  21. Y. Gurevich, "Recognizing Satisfiability of Predicate Formulas", Algebra and Logic 5:2 (1966), 25–55; "The Decision Problem for Logic of Predicates and Operations", Algebra and Logic 8 (1969), pages 160–174 of English translation; "The Decision Problem for Standard Classes", Journal of Symbolic Logic 41 (1976), 460–464.

    Google Scholar 

  22. Y. Gurevich, "Algebras of Feasible Functions", Proc. of 24th IEEE Symposium on Foundations of Computer Science, 1983, 210–214.

    Google Scholar 

  23. J.E. Hopcroft and J.D. Ullman, "Introduction to Automata Theory, Languages and Computation", Addison-Wesley, 1979.

    Google Scholar 

  24. N. Immerman, "Relational Queries Computable in Polynomial Time", Proc. of 14th ACM Symposium on Theory of Computing, 1982, 147–152.

    Google Scholar 

  25. N. Immerman, "Languages which Capture Complexity Classes", Proc. of 15th ACM Symposium on Theory of Computing, 1983, 347–354.

    Google Scholar 

  26. N.G. Jones and A.L. Selman, "Turing Machines and the Spectra of First-Order Formulas", Journal of Symbolic Logic 39 (1974), 139–150.

    Article  MathSciNet  MATH  Google Scholar 

  27. V.F. Kostyrko, "To the Decision Problem for Predicate Logic", Ph.D. Thesis, Kiev, 1965 (Russian).

    Google Scholar 

  28. G. Kreisel, Technical Report No. 3, Applied Mathematics and Statistics Labs., Stanford University, January 1961.

    Google Scholar 

  29. A.B. Livchak, "The Relational Model for Systems of Automatic Testing", Automatic Documentation and Mathematical Linguistics 4 (1982), pages 17–19 of Russian original.

    Google Scholar 

  30. A.B. Livchak, "The Relational Model for Process Control", Automatic Documentation and Mathematical Linguistics 4 (1983), pages 27–29 of Russian original.

    Google Scholar 

  31. P. Lindström, "On Extensions of Elementary Logic", Theoria 35 (1969), 1–11.

    Article  MathSciNet  MATH  Google Scholar 

  32. D. Mundici, "Complexity of Craig's Interpolation", Annales Societ. Math. Polonae, Series IV: Fundamenta Informaticae, vol. 3–4 (1982); "NP and Craig's Interpolation Theorem", Proc. of Florence Logic Colloquium 1982, North Holland, to appear.

    Google Scholar 

  33. V. Sazonov, "Polynomial Computability and Recursivity in Finite Domains", Elektronische Informationsverarbeitung and Kybernetik 16 (1980), 319–323.

    MathSciNet  MATH  Google Scholar 

  34. L.J. Stockmeyer, "The Polynomial — Time Hierarchy", Theoretical Computer Science 3 (1977), 1–22.

    Article  MathSciNet  MATH  Google Scholar 

  35. W.W. Tait, "A Counterexample to a Conjecture of Scott and Suppes", Journal of Symbolic Logic 24 (1959), 15–16.

    Article  MathSciNet  MATH  Google Scholar 

  36. A. Tarski, "A Lattice-Theoretical Fixpoint Theorem and its Application", Pasific Journal of Mathematics 5 (1955), 285–309.

    Article  MathSciNet  MATH  Google Scholar 

  37. B.A. Trakhtenbrot, "Impossibility of an Algorithm for the Decision Problem on Finite Classes", Doklady 70 (1950), 569–572.

    Google Scholar 

  38. J.D. Ullman, "Principles of Database Systems", Computer Science Press, 1982.

    Google Scholar 

  39. L.G. Valiant, "Relative Complexity of Checking and Evaluating", Information Processing 5 (1976), 20–23.

    Article  MathSciNet  MATH  Google Scholar 

  40. M.Y. Vardi, "Complexity of Relational Query Languages", Proc. of 14th ACM Symposium on Theory of Computing, 1982, 137–146.

    Google Scholar 

  41. M.M. Zloof, "Query-by-Example: a Database Languages`, IBM Syst. Journal 16 (1977), 324–343.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, The University of Michigan, 48109, Ann Arbor, Michigan

    Yuri Gurevich

Authors
  1. Yuri Gurevich
    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

Gurevich, Y. (1984). Toward logic tailored for 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/BFb0099486

Download citation

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

  • 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