Skip to main content
SpringerLink
Log in

Quantifiers in combinatory PDL: Completeness, definability, incompleteness

  • Late Arrivals
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

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

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. G.Gargov & S.Passy, Determinism and Looping in Combinatory PDL, April 1985, Submitted to FOCS'85.

    Google Scholar 

  2. D.Harel, Recurring Dominoes: Making the Highly Undecidable Highly Understandable, Ann. of Discr. Math., 1985 (in press), also in: Springer LNCS 158 (1983), 179–194.

    Google Scholar 

  3. S. Passy & T. Tinchev, PDL with Data Constants, Inform. Proc. Lett., 20 (1985), 35–41.

    Google Scholar 

  4. S.Passy & T.Tinchev, Combinatory Dynamic Logic, January 1985, Submitted to Information and Control.

    Google Scholar 

  5. J.Shoenfield, Mathematical Logic, Addison — Wesley, 1967.

    Google Scholar 

  6. D.Skordev, A Formal System for Proving Some Properties of Programs, 1981, to appear in Fundamenta Informaticae.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Faculty, blvd. Anton Ivanov 5, 1126, Sofia, Bulgaria

    Solomon Passy & Tinko Tinchev

Authors
  1. Solomon Passy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tinko Tinchev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Passy, S., Tinchev, T. (1985). Quantifiers in combinatory PDL: Completeness, definability, incompleteness. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028835

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation