Preview
Unable to display preview. Download preview PDF.
References
RASIOWA, H; SIKORSKI, R. Mathematics of metamathematics. Polish Scientific Publishers. Warsaw, 1968.
SALWICKI, A. Formalized algorithmic languages. Bull.Acad.Polon.Sci.,Ser.Sci.Math.Astronom.Phys. 18(1970), 227–232.
KRECZMAR,A. Effectivity problems of algorithmic logic. 2-nd Colloquium on Automata, Languages and Programming. Lecture notes on Computer Science,No.14,Springer Verlag, 1974.
FLOYD,R.W. Assigning meanings of programs. Proc.Sym.in Applied Math. 19 (1967). in Mathematical aspects of Computer Science, American Mathematical Society.
HOARE, C.A.R. An axiomatic basis of computer programming. Comm.ACM 12 (1969), 576–583.
MANNA, Z. The correctness of programs. J.Comp.Syst.Sci. 3 (1969), 119–127.
BANACHOWSKI, L. Extended algorithmic logic and its properties. to appear in Bull.Acad.Polon.Sci.,Ser.Sci.Math.Astronom.Phys.
MIRKOWSKA,M. Algorithmic logic and its applications in the theory of programs. Doct.Diss. Warsaw 1972 /in Polish/.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banachowski, L. (1975). Modular approach to the logical theory of programs. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_693
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_693
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive