Propositional dynamic logics with counters and stacks

  • Tinko Tinchev
  • Dimiter Vakarelov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


Canonical Model Axiom Scheme Propositional Dynamic Logic Propositional Constant Springer LNCS 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Goldblatt, R. Axiomatising the Logic of Computer Programming, Springer LNCS 130 (1982).Google Scholar
  2. [2]
    Harel, D. Recurring Domimoes: Making the Highly Undecidable Highly Understandable, in: Springer LNCS 158 (1983), 177–194.Google Scholar
  3. [3]
    Harel, D., A. Pnueli and J. Stavi, Propositional Dynamic Logic of Nonregular Programs, JCSS 26, (1983), 222–243.Google Scholar
  4. [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. [5]
    Mirkowska, G. PAL — Propositional Algorithmic Logic, in: Springer LNCS 125 (1981), 23–101.Google Scholar
  6. [6]
    Mirkowska, G. On the Propositional Algorithmic Theory of Arithmetic, in: Springer LNCS 148 (1983), 166–185.Google Scholar
  7. [7]
    Salwicki,A. On Algorithmic Theory of Stacks, ICS PAS report Nr 337Google Scholar
  8. [8]
    Tinchev, T. and D. Vakarelov. Propositional Dynamic Logic with Recursive Programs, submitted.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Tinko Tinchev
    • 1
  • Dimiter Vakarelov
    • 1
  1. 1.Mathematics FacultySofiaBulgaria

Personalised recommendations