Skip to main content
SpringerLink
Log in

An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic

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

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

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. J. Barwise, On Moschovakis' Closure Ordinals, Journal of Symbolic Logic 42 (1977) 292–296.

    Google Scholar 

  2. Ariel Calò, The Expressive Power of Transitive Closure, M. Sc. Thesis, Technion-Israel Inst. of Technology, Haifa 1990.

    Google Scholar 

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

    Google Scholar 

  4. A. Chandra and D. Harel, Horn Clause Queries and Generalizations, J. Logic Programming 1 (1985) 1–15.

    Google Scholar 

  5. K. J. Compton Stratified Least Fixpoint Logic, to appear.

    Google Scholar 

  6. E. Dahlhaus, Skolem Normal Forms Concerning the Least Fixed Point, in: “Computation Theory and Logic” (Ed. E. Börger), Lecture Notes in Computer Science Nr. 270, Springer 1987, 101–106.

    Google Scholar 

  7. M. de Rougemont, Second Order and Inductive Definability on Finite Structures, Zeitschrift f. mathem. Logik und Grundlagen der Mathematik 33 (1987) 47–63.

    Google Scholar 

  8. E. Grädel und G. L. McColm, Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic, to appear in Annals of Pure and Applied Logic.

    Google Scholar 

  9. M. Grohe, Fixpunktlogiken in der endlichen Modelltheorie, Diplomarbeit an der Universität in Freiburg, Institut für mathematische Logik.

    Google Scholar 

  10. Y. Gurevich and S. Shelah, Fixed Point Extensions of First Order Logic, Annals of Pure and Applied Logic 32 (1986), 265–280.

    Google Scholar 

  11. N. Immerman, Upper and Lower Bounds for First Order Expressibility, Journal of Computer and System Sciences 25 (1982) 76–98.

    Google Scholar 

  12. N. Immerman, Relational Queries Computable in Polynomial Time, Information and Control 68 (1986), 86–104.

    Google Scholar 

  13. N. Immerman, Languages that capture complexity classes, SIAM Journal of computation, 16 (1987), 760–778.

    Google Scholar 

  14. Ph. Kolaitis, The Expressive Power of Stratified Logic Programs, Information and Computation 90 (1991) 50–66.

    Google Scholar 

  15. Ph. Kolaitis and M. Vardi, Fixpoint logic vs. infinitary logic in Finite-model The-ory, to appear.

    Google Scholar 

  16. Y. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam 1974.

    Google Scholar 

  17. M. Vardi, Complexity of Relational Query Languages, Proc. of 14th ACM Symposium on Theory of Computing (1982) 137–146.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für mathematische Logik der Albert-Ludwigs-Universität Freiburg i. Brsg., Abertstr. 23b, DW-7800, Freiburg

    Uwe Bosse

Authors
  1. Uwe Bosse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Jäger H. Kleine Büning S. Martini M. M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bosse, U. (1993). An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-56992-8_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56992-3

  • Online ISBN: 978-3-540-47890-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation