Skip to main content
SpringerLink
Log in

Propositional dynamic logics with counters and stacks

  • Conference paper
  • First Online:
Computation Theory (SCT 1984)

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

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. Goldblatt, R. Axiomatising the Logic of Computer Programming, Springer LNCS 130 (1982).

    Google Scholar 

  2. Harel, D. Recurring Domimoes: Making the Highly Undecidable Highly Understandable, in: Springer LNCS 158 (1983), 177–194.

    Google Scholar 

  3. Harel, D., A. Pnueli and J. Stavi, Propositional Dynamic Logic of Nonregular Programs, JCSS 26, (1983), 222–243.

    Google Scholar 

  4. Meyer, A., R. Streett and G. Mirkowska, The Deducibility Problem in Propositional Dynamic Logic, in: Springer LNCS 115 (1981), 12–22.

    Google Scholar 

  5. Mirkowska, G. PAL — Propositional Algorithmic Logic, in: Springer LNCS 125 (1981), 23–101.

    Google Scholar 

  6. Mirkowska, G. On the Propositional Algorithmic Theory of Arithmetic, in: Springer LNCS 148 (1983), 166–185.

    Google Scholar 

  7. Salwicki,A. On Algorithmic Theory of Stacks, ICS PAS report Nr 337

    Google Scholar 

  8. Tinchev, T. and D. Vakarelov. Propositional Dynamic Logic with Recursive Programs, submitted.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tinko Tinchev & Dimiter Vakarelov

Authors
  1. Tinko Tinchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimiter Vakarelov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tinchev, T., Vakarelov, D. (1985). Propositional dynamic logics with counters and stacks. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-16066-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation