Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1995: Computer Science Logic pp 161–177Cite as

First order logic, fixed point logic and linear order

  • Conference paper
  • First Online:

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

Abstract

The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order logic on every infinite class of finite ordered structures. In this paper, we develop the tool of bounded variable element types, and illustrate its application to this and the original conjectures of McColm, which arose from the study of inductive definability and infinitary logic on proficient classes of finite structures (those admitting an unbounded induction). In particular, for a class of finite structures, we introduce a compactness notion which yields a new proof of a ramified version of McColm's second conjecture. Furthermore, we show a connection between a model-theoretic preservation property and the Ordered Conjecture, allowing us to prove it for classes of strings (colored orderings). We also elaborate on complexity-theoretic implications of this line of research.

Research supported by EPSRC grant GR/H 81108

Partially supported by NSF grant CCR-9403447, and the John C. Whitehead faculty research fund at Haverford College

Supported in part by NSF CCR-9403447.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62–124, 1991.

    Google Scholar 

  2. S. Abiteboul and V. Vianu. Computing with first-order logic. Journal of Computer and System Sciences, 50(2):309–335, 1995.

    Google Scholar 

  3. D.M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274–306, 1990.

    Google Scholar 

  4. A. Dawar. Feasible Computation through Model Theory. PhD thesis, University of Pennsylvania, 1993.

    Google Scholar 

  5. A. Dawar and L. Hella. The expressive power of finitely many generalized quantifiers. Information and Computation, 123(2):172–184, 1995.

    Google Scholar 

  6. A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119(2):160–175, 1995.

    Google Scholar 

  7. Y. Gurevich, N. Immerman, and S. Shelah. McColm's conjecture. In Proc. 9th IEEE Symp. on Logic in Computer Science, 1994.

    Google Scholar 

  8. Y. Gurevich. Toward logic tailored for computational complexity. In M. Richter et al., editors, Computation and Proof Theory, pages 175–216. Springer Lecture Notes in Mathematics, 1984.

    Google Scholar 

  9. N. Immerman and D. Kozen. Definability with bounded number of bound variables. Information and Computation, 83:121–139, 1989.

    Google Scholar 

  10. N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76–98, 1982.

    Google Scholar 

  11. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.

    Google Scholar 

  12. Ph. G. Kolaitis and M. Y. Vardi. Fixpoint logic vs. infinitary logic in finite-model theory. In Proc. 7th IEEE Symp. on Logic in Computer Science, pages 46–57, 1992.

    Google Scholar 

  13. Ph. G. Kolaitis and M. Y. Vardi. Infinitary logics and 0–1 laws. Information and Computation, 98(2):258–294, 1992.

    Google Scholar 

  14. G. L. McColm. When is arithmetic possible? Annals of Pure and Applied Logic, 50:29–51, 1990.

    Google Scholar 

  15. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.

    Google Scholar 

  16. B. Poizat. Deux ou trois choses que je sais de L n. Journal of Symbolic Logic, 47(3):641–658, 1982.

    Google Scholar 

  17. A. Stolbouskin and M. Taitslin. Is first order contained in an initial segment of PTIME? In Computer Science Logic 94, volume 933 of LNCS. Springer-Verlag, 1995.

    Google Scholar 

  18. M. Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on the Theory of Computing, pages 137–146, 1982.

    Google Scholar 

  19. C. Wrathall. Rudimentary predicates and relative computation. SIAM Journal on Computing, 7(2):194–209, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of Wales, SA2 8PP, Swansea, Swansea, UK

    Anuj Dawar

  2. Dept. of Computer Science, Haverford College, 19041, Haverford, PA, USA

    Steven Lindell

  3. Dept. of Philosophy, Univ. of Pennsylvania, 19104, Philadelphia, PA, USA

    Scott Weinstein

Authors
  1. Anuj Dawar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven Lindell
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Scott Weinstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Kleine Büning

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dawar, A., Lindell, S., Weinstein, S. (1996). First order logic, fixed point logic and linear order. In: Kleine Büning, H. (eds) Computer Science Logic. CSL 1995. Lecture Notes in Computer Science, vol 1092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61377-3_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-61377-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation