Skip to main content
SpringerLink
Log in
Book cover

Symposium on Computation Theory

SCT 1984: Computation Theory pp 276–287Cite as

Theories of interacting stacks

  • Conference paper
  • First Online:

  • 129 Accesses

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

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Constable R.L. and O'Donnel M.J., Programming Logic, Winthrop Publishers, 1978.

    Google Scholar 

  2. Harel D., First-Order Dynamic Logic, Lecture Notes in Comp. Sci. 68 (1979).

    Google Scholar 

  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. Janicki R., An algebraic approach to the theory of recursive coroutines, Fundamenta Informaticae I. 1 (1977), 131–145.

    Google Scholar 

  5. Mazurkiewicz A., Recursive algorithms and formal languages, Bull. Pol. Ac. Sci. Ser. Math. Astron. Phys. 20 (1972), 799–809.

    Google Scholar 

  6. Mirkowska G., Algorithmic logic with nondeterministic programs, Fundamenta Informaticae III. 1 (1980), 45–64.

    Google Scholar 

  7. Mirkowska G., Model existence theorem for algorithmic logic with nondeterministic programs, Fundamenta Informaticae III. 2 (1980), 157–170.

    Google Scholar 

  8. Pratt V., Semantical consideration on Floyd Hoare Logic, Proc. 17th Symp. on FCS, Houston, Texas, October 1976, 109–121.

    Google Scholar 

  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. Rasiowa H., Completeness in Classical Logic of Complex Algorithms, Proc. MFCS'80, ibid. 88 (1980), 488–503.

    Google Scholar 

  11. Rasiowa H., Logic LNCA of nondeterministic complex algorithms, Proc, 4th Symp. MFCS, Poland-GDR, Diedrichshagen, 6–11 Dec. 1982.

    Google Scholar 

  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. Rasiowa H. and Sikorski R., The mathematics of metamathematics, PWN — Polish Scientific Publishers 3-rd ed. 1970.

    Google Scholar 

  14. Salwicki A., Formalized algorithmic languages, Bull. Pol. Ac. Sci., Ser. Math. Astron. Phys. 18 (1970), 227–232.

    Google Scholar 

  15. Salwicki A., On the algorithmic theory of stacks, Fundamenta Informaticae III. 3 (1980), 311–332.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw PKiN, 00-901, Warsaw, Poland

    Helena Rasiowa

Authors
  1. Helena Rasiowa
    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

Rasiowa, H. (1985). Theories of interacting 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_23

Download citation

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

  • 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