Abstract
In the paper we solve some effectivity problems of program schemas. Such properties of programs as, for example, the strong and the weak equivalence, the correctness and the partial correctness of a program, the halting problem are classified in Kleene-Mostowski hierarchy. A basic tool used in the paper is algorithmic logic.
Subject
Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献