Skip to main content

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

  • 1885 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BACHMANN, H.: Transfinite Zahlen. Berlin-Heidelberg-New York: Springer 1967

    Google Scholar 

  2. DE BAKKER. J.W. and DE ROEVER, W. P.: A Calculus for Recursive Program Schemes. In: NIVAT, M. (ed.): Automata, Languages and Programming. Amsterdam-London-New York: North-Holland/American Elsevier 1973

    Google Scholar 

  3. BLIKLE, A.: An extended approach to mathematical analysis of programs. CC PAS Report 169, Warsaw 1974

    Google Scholar 

  4. BURSTALL, R.M.: Program Proving as Hand Simulation with a Little Induction. Information Processing 74, 308–312. Amsterdam: North-Holland 1974

    Google Scholar 

  5. ENGELER, E.: Algorithmic Properties of Structures. Math. Systems Theory 1, 183–195 (1967)

    Article  Google Scholar 

  6. HAYES, P.J.: Robotologic. In: MELTZER, B., MICHIE, D. (ed.): Machine Intelligence 5. Edinburgh University Press 1969

    Google Scholar 

  7. HOARE, C.A.R.: An Axiomatic Basis for Computer Programming. CACM 12, 576–580 (1969)

    Google Scholar 

  8. KRIPKE, S.A.: Semantical Analysis of Modal Logic I. Zeitschr. für mathem. Logik und Grundl. der Mathematik 9, 67–96 (1963)

    Google Scholar 

  9. KRÖGER, F.: An Extension of Propositional Logic by Algorithmic Concepts. Abteilung Mathematik der TUM, Bericht Nr. 7419

    Google Scholar 

  10. SALWICKI, A.: Formalized Algorithmic Languages. Bull. Acad. Polon. Sci, Ser. Math. Astronom. Phys. 18, 227–232 (1970)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kröger, F. (1975). Formalization of algorithmic reasoning. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_210

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_210

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics