A predicate logic of well-founded actions

  • Mikle Kuchuganov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 813)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nepejvoda, N. On some semantic aspects of a constructive logics of program shemes. Computing Systems 129 (Novosibirsk, 1989) 49–66.Google Scholar
  2. 2.
    Nepejvoda, N. A bridge between constructive logic and computer programming. Theoretical Computer Science 90 (1991) 253–270.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Mikle Kuchuganov
    • 1
  1. 1.Department of Mathematics & Computer SciencesUniversity of UdmurtiaIzhevskRussia

Personalised recommendations