Skip to main content
SpringerLink
Log in

Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic

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

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

Included in the following conference series:

Abstract

We present new general method for proving that for certain classes of finite structures the limit law fails for properties expressible in transitive closure logic. In all such cases also all associated asymptotic problems are undecidable.

This research was completed in the Institute of Mathematics, University of Warsaw.

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. K.J. Compton. A logical approach to asymptotic combinatorics I. First order properties, Advances in Mathematics 65(1987), 65–96.

    Google Scholar 

  2. K.J. Compton. 0–1 laws in logic and combinatorics, Proc. NATO Advanced Study Institute on Algorithms and Order (I. Rival, ed.), Reidel, Dordrecht (1988).

    Google Scholar 

  3. K.J. Compton, C.W. Henson, and S. Shelah. Nonconvergence, undecidability and intractability in asymptotic problems, Annals of Pure and Applied Logic, 36(1987), 207–224.

    Google Scholar 

  4. K.J. Compton, and S. Shelah. A convergence theorem for unary functions, in preparation.

    Google Scholar 

  5. P. Cousot. Methods and logics for proving programs, in: J. van Leeuven (ed.) Handbook of theoretical computer science, North Holland, Amsterdam, 1990.

    Google Scholar 

  6. P. Erdős, and A. Rényi. On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Kőzl. 5(1960), 17–61.

    Google Scholar 

  7. D. Harel, and D. Peleg. On static logics, dynamic logics, and complexity classes, Infor. and Control 60(1984), 86–102.

    Google Scholar 

  8. B. Harris. Probability distributions related to random mappings, The Annals of Mathematical Statistics 31(1960), 1045–1062.

    Google Scholar 

  9. N. Immerman. Languages that capture complexity classes, SIAM Journal of Computing 16, No. 4(1987).

    Google Scholar 

  10. Ph. Kolaitis. On asymptotic probabilities of inductive queries and their decision problem, in: Logics of Programs, Brooklyn, June 1985, Lecture Notes in Comp. Sci. 193, Springer Verlag, 1985, 153–166.

    Google Scholar 

  11. Ph. Kolaitis, and M.Y. Vardi. Zero-one laws for infinitary logics, Proc. 5th IEEE Symp. on Logic in Computer Science, 1990, 156–167.

    Google Scholar 

  12. D. Kozen, and J. Tiuryn. Logics of programs, in: J. van Leeuven (ed.) Handbook of theoretical computer science, North Holland, Amsterdam, 1990.

    Google Scholar 

  13. J. Tiuryn, and P. Urzyczyn. Some relationships between logics of programs and complexity theory, Theoretical Computer Science, 60(1988), 83–108.

    Google Scholar 

  14. J. Tyszkiewicz. Infinitary Queries and Their Asymptotic Probabilities II: Properties Definable in Least Fixed Point Logic, to appear in Proc. Random Graphs'91, Poznań, Poland, August 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warszawa, Poland

    Jerzy Tyszkiewicz

Authors
  1. Jerzy Tyszkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Gerhard Jäger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tyszkiewicz, J. (1992). Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023784

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47285-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation