Skip to main content
SpringerLink
Log in

Expressibility of first order logic with a nondeterministic inductive operator

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

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. Chandra, A., (1981) Programming Primitives for Database Languages, 8th Symposium on Principles of Programming Languages, ACM, pp 50–62.

    Google Scholar 

  2. Chandra, A. and Harel, D., (1982) Structure and Complexity of Computable Queries, Journal of Comp. and System Sciences, 25, pp 99–128.

    Google Scholar 

  3. Chandra, A. and Harel, D., (1982) Horn Clauses and the Fixpoint Query Hierarchy, Proc. ACM Symp. on Principles of Database Systems.

    Google Scholar 

  4. Garey, M.R. and Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman.

    Google Scholar 

  5. Gurevich, Y., (1984) Toward Logic Tailored for Computational Complexity, Proc. Logic Colloq. Aachen 1983, Lecture Notes in Mathematics, Vol. 1104, pp 175–216, Springer-Verlag.

    Google Scholar 

  6. Gurevich, Y., (1985) Logic and the Challenge of Computer Science, Technical Report, University of Michigan, Computing Research Laboratory, CRL-TR-10-85.

    Google Scholar 

  7. Immerman, N., (1982) Relational Queries Computable in Polynomial Time (Extended Abstract), 14th ACM Symp. on Theory of Computing, pp 147–152.

    Google Scholar 

  8. Immerman, N., (1983) Languages which Capture Complexity Classes (Preliminary Report), 15th ACM Symp. on Theory of Computing, pp 347–354.

    Google Scholar 

  9. Vardi, M.Y., (1982) The Complexity of Relational Query Languages (Extended Abstract), 14th ACM Symp. on Theory of Computing, pp 137–146.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India

    V. Arvind & S. Biswas

Authors
  1. V. Arvind
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arvind, V., Biswas, S. (1987). Expressibility of first order logic with a nondeterministic inductive operator. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039616

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation