Abstract
Recently a new constructive logic of program schemes, have been developed by N.N. Nepejvoda (see [1], [2]). In the logic a programs are treated as state transformers, as actions, which decrease a well-founded resource. So the logic provide easy loop construction and allow to obtain totally correct program schemes. In Nepejvoda calculi Ω actions are ivestigated inside propositional logic framework. In this paper we elaborate a notion of well-founded action and prove useful results allowing investigate actions inside framework of any logic with compactness property. As example, we describe a predicate calculi of well-founded actions PΩ and prove its soundness and completeness.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Nepejvoda, N. On some semantic aspects of a constructive logics of program shemes. Computing Systems 129 (Novosibirsk, 1989) 49–66.
Nepejvoda, N. A bridge between constructive logic and computer programming. Theoretical Computer Science 90 (1991) 253–270.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuchuganov, M. (1994). A predicate logic of well-founded actions. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive