This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Chlebus B., On decidability of propositional algorithmic logic Inst.of Informatics Reports. University of Warsaw, 1979
Malcev A.I., Algorithms and recursive functions, Moscow 1965.
Mirkowska G., On the propositional algorithmic logic, Proc. of MFCS'79. Olomouc, Lecture Notes on Computer Science, Springer Verlag 74.
Mirkowska G., Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations Proc. 12 th Ann. ACM Symp. on theory of Computing, Los Angeles 1980.
Pratt V.,Salwicki A., personal communication
Rogers H., The theory of recursive functions and effective compitability, Mc.Graw-Hill, New York 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mirkowska, G. (1983). On the propositional algorithmic theory of arithmetic. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-11981-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11981-4
Online ISBN: 978-3-540-39445-7
eBook Packages: Springer Book Archive