Theories of interacting stacks

  • Helena Rasiowa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Constable R.L. and O'Donnel M.J., Programming Logic, Winthrop Publishers, 1978.Google Scholar
  2. [2]
    Harel D., First-Order Dynamic Logic, Lecture Notes in Comp. Sci. 68 (1979).Google Scholar
  3. [3]
    Hitchcock P. and Park D., Induction Rules and Termination Proofs, Automata, Languages and Programming (ed. Nivat), American Elsevier, New York 1973, 225–251.Google Scholar
  4. [4]
    Janicki R., An algebraic approach to the theory of recursive coroutines, Fundamenta Informaticae I. 1 (1977), 131–145.Google Scholar
  5. [5]
    Mazurkiewicz A., Recursive algorithms and formal languages, Bull. Pol. Ac. Sci. Ser. Math. Astron. Phys. 20 (1972), 799–809.Google Scholar
  6. [6]
    Mirkowska G., Algorithmic logic with nondeterministic programs, Fundamenta Informaticae III. 1 (1980), 45–64.Google Scholar
  7. [7]
    Mirkowska G., Model existence theorem for algorithmic logic with nondeterministic programs, Fundamenta Informaticae III. 2 (1980), 157–170.Google Scholar
  8. [8]
    Pratt V., Semantical consideration on Floyd Hoare Logic, Proc. 17th Symp. on FCS, Houston, Texas, October 1976, 109–121.Google Scholar
  9. [9]
    Rasiowa H., ω+-valued algorithmic logic as a tool to investigate procedures, Proc. MFCS'74, Lecture Notes in Comp. Sci. 28 (1975).Google Scholar
  10. [10]
    Rasiowa H., Completeness in Classical Logic of Complex Algorithms, Proc. MFCS'80, ibid. 88 (1980), 488–503.Google Scholar
  11. [11]
    Rasiowa H., Logic LNCA of nondeterministic complex algorithms, Proc, 4th Symp. MFCS, Poland-GDR, Diedrichshagen, 6–11 Dec. 1982.Google Scholar
  12. [12]
    Rasiowa H., Complete formalizations of theories of interacting stacks, Abstracts of papers presented to the AMS, Vol. 4, No 1, 89th Annual Meeting, Denver, January 5–9, 1983.Google Scholar
  13. [13]
    Rasiowa H. and Sikorski R., The mathematics of metamathematics, PWN — Polish Scientific Publishers 3-rd ed. 1970.Google Scholar
  14. [14]
    Salwicki A., Formalized algorithmic languages, Bull. Pol. Ac. Sci., Ser. Math. Astron. Phys. 18 (1970), 227–232.Google Scholar
  15. [15]
    Salwicki A., On the algorithmic theory of stacks, Fundamenta Informaticae III. 3 (1980), 311–332.Google Scholar
  16. [16]
    Tiuryn J., A survey of logic of effective definitions, Proc. Conf. Logics of Programs, Zürich 1979 (ed. Engeler), Lecture Notes in Comp. Sci., 125 (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Helena Rasiowa
    • 1
  1. 1.Institute of MathematicsUniversity of Warsaw PKiNWarsawPoland

Personalised recommendations