Skip to main content
SpringerLink
Log in

Is first order contained in an initial segment of PTIME?

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 933))

Included in the following conference series:

Abstract

By “initial segments of P” we mean classes DTime(n k). The question of whether for any fixed signature the first-order definable predicates in finite models of this signature are all in an initial segment of P is shown to be related to other intriguing open problems in complexity theory and logic, like P=PSpace.

The second part of the paper strengthens the result of Ph. Kolaitis of logical definability of unambiguous computations.

This work has been partially supported by NSF Grant CCR 9403809.

A part of this research was carried out while the author was visiting UCLA and supported in part by NSF Grant CCR 9403809.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman, “The design and analysis of computer algorithms”, Addison-Wesley Publ. Co., 1974, 1–470.

    Google Scholar 

  2. Aho, Alfred V., and Jeffrey D. Ullman, Universality of data retrieval languages, in: “Proceedings of the 6th ACM Symp. on Principles of Programming Languages (POPL)”, 1979, 110–117.

    Google Scholar 

  3. Behmann, Heinrich, Beiträge zur Algebra der Logic, insbesondere zur Entscheidungproblem, Math. Ann., 86, 1922, 163–229.

    MathSciNet  Google Scholar 

  4. Chandra, Ashok K., and David Harel, Structure and complexity of relational queries, J. Comput. Syst. Sci., 25, 1980, 156–178.

    Article  Google Scholar 

  5. Grohe, Martin, Bounded-arity hierarchies in fixed-point logics, in: “Proceedings of CSL '93. 1993 Annual Conference of the European Association for Computer Science Logic, Swansea, UK, 13–17 Sept. 1993)” (Borger, E.; Gurevich, Y.; Meinke, K., Eds.), Springer-Verlag: Berlin, 1994. 150–164.

    Google Scholar 

  6. Gurevich, Yuri, Algebras of feasible functions, in: “24th Symp. on Foundations of Computer Science (FOCS)”, IEEE Computer Society Press, 1983, 210–214.

    Google Scholar 

  7. Gurevich, Yuri, Logic and the challenge of computer science, in: “Current Trends in Theoretical Computer Science” (Egon Börger, Ed.), Computer Science Press: Rockville, Md., 1987, 1–57.

    Google Scholar 

  8. Enderton, Herbert B., “A mathematical introduction to logic”, Academic Press: New York, 1972.

    Google Scholar 

  9. Ershov, Yuri L., Igor A. Lavrov, Asan D. Taimanov, and Michael A. Taitslin, Elementary theories, Russian Mathematical Surveys, 20:4, 1965, 35–105.

    Article  Google Scholar 

  10. Hennie, F.C., and R.E. Stearns, Two tape simulation of multitape machines, J. ACM, 13:4, 533–546.

    Google Scholar 

  11. Immerman, Neil, Relational queries computable in polynomial time, in: “14th ACM Symp. on Theory of Computing (STOC)”, ACM, 1982, 147–152.

    Google Scholar 

  12. Immerman, Neil, Languages that capture complexity classes, S1AM J. Computing, 16, 1987, 760–778.

    Article  Google Scholar 

  13. Kolaitis, Phokion G., Implicit definability on finite structures and unambiguous computations, in: “5th IEEE Annu. Symp. on Logic in Computer Science (LICS)”, IEEE Computer Society Press: Los Alamitos, CA, 1990, 168–180.

    Google Scholar 

  14. Livchak, Alexander B., The relational model for process control, in: “Automatic Documentation and Mathematical Linguistics 4”, Moscow, 1983, 27–29.

    Google Scholar 

  15. Maltsev, Anatoly I., Regular products of models, Izv. Acad. Nauk. SSSR, Ser. Mat., 23, 1959, 489–502.

    Google Scholar 

  16. Moschovakis, Yiannis N., “Elementary induction on abstract structures”, North-Holland/Elsevier: Amsterdam/New York, 1974, 218pp.

    Google Scholar 

  17. Sazonov, Valdimir Yu., Polinomial computability and recursivity in finite domains, Elektronische Informationsverarbeitung und Kybernetik, 16, 1980, 319–323.

    Google Scholar 

  18. Stolboushkin, Alexei P., and Michael A. Taitslin, Dynamic logics, in: “Cybernetics and Computing Technology” (V.A. Mel'nikov, Ed.), Moscow: Nauka, 1986, 180–230.

    Google Scholar 

  19. Valiant, L., Relative complexity of checking and evaluating, Information Processing, 5, 1976, 20–23.

    Article  Google Scholar 

  20. Vardi, Moshe Y., Complexity of relational query languages, in: “14th ACM Symp. on Theory of Computing”, ACM, 1982, 137–146.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, UCLA, 90024-1555, Los Angeles, CA

    Alexei P. Stolboushkin

  2. Department of Computer Science, Tver State University, 170000, Tver, Russia

    Michael A. Taitslin

Authors
  1. Alexei P. Stolboushkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Taitslin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stolboushkin, A.P., Taitslin, M.A. (1995). Is first order contained in an initial segment of PTIME?. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022260

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation