Abstract
Extended algorithmic logic (EAL) as introduced in [18] is a modified version of extended ω+-valued algorithmic logic. Only two-valued predicates and two-valued propositional variables occur in EAL. The role of the ω+-valued logic is restricted to construct control systems (stacks) of pushdown algorithms whereas their actions are described by means of the two-valued logic. Thus EAL formalizes a programming theory with recursive procedures but without the instruction CASE.
The aim of this paper is to discuss EAL and prove the completeness theorem. A complete formalization of EAL was announced in [20] but no proof of the completeness theorem was given.
Similar content being viewed by others
References
L. Banachowski, Investigations of properties of programs by means of the extended algorithmic logic, Fundatmenta Informaticae 1, No 1, 2 (1977), pp. 93–119, 169–194.
A. Blikle, A. Mazurkiewicz, An algebraic approach to the theory of programs, algorithms, languages and recursiveness, Proc. Intern. Symp. and Summer School on MFCS, Warsaw-Jablonna 1972, CO PAS Reports 1972.
E. Engeler, Algorithmic properties of structures, Mathematical Systems Theory 1 (1967), pp. 183–195.
D. Harel, V. Pratt, Nondeterminism in Logics of Programs, Proc. 9-th Ann. ACM Symp. on Theory of Computing, Boulder, Colorado, May 1977.
D. Harel, A. R. Meyer, V. Pratt, Computability and Completeness in Logics of Programs, ibid.
R. Janicki, An algebraic approach to the theory of recursive coroutines, Fundamenta Informaticae 1, No 1, (1977), pp. 131–145.
C. R. Karp, Languages with Expressions of Infinite Length, North-Holland, 1964.
G. Mirkowska, Algorithmic logic and its applications in the theory of programs, Fundamenta Informaticae 1, No 1, 2 (1977), pp. 1–17, pp. 147–165.
G. Mirkowska, Algorithmic logic of non deterministic programs, Fundamenta Informaticae, to appear.
G. Mirkowska, Model existence theorem for algorithmic logic of non deterministic programs, Fundamenta Informaticae, to appear.
R. Parikh, A completeness result for a propositional dynamic logic, M. I. T. /LCS/TM-106.
V. Pratt, Semantical Considerations on Floyd-Hoare Logic, 17-th IEEE Symp. on FCS, Oct. 1976.
H. Rasiowa, On generalized Post algebras of order ω+ and ω+-valued predicate calculi, Bulletin de l'Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 21 (1973), pp. 209–219.
H. Rasiowa, On logical structure of mixed-valued programs and ω+-valued algorithmic logic, ibid 21 (1973), pp. 451–458.
H. Rasiowa, Formalized ω+-valued algorithmic systems, ibid. pp. 559–565.
H. Rasiowa, A simplified formalization of ω+-valued algorithmic logic, ibid. 22 (1974), pp. 595–603.
H. Rasiowa, Extended ω+-valued algorithmic logic, ibid. pp. 605–610.
H. Rasiowa, ω+-valued algorithmic logic as a tool to investigate procedures, Proc. MFCS' 74, Lecture Notes in Computer Science 28, Springer (1974).
H. Rasiowa, Many-valued algorithmic logic as a tool to investigate programs, in: Modern Uses of Multiple-Valued Logic, D. Reidel, 1977, 79–102.
H. Rasiowa, Completeness theorem for extended algorithmic logic, Proc. 5-th Int. Congress of Logic, Methodology and Philosophy of Science, 1975, III, 13–15.
A. Salwicki, Formalised algorithmic languages, Bulletin de l'Académie Polonaise des Sciences. Série des Sciences Mathématiques, Astronomiques et Physiques 18 (1970), 227–232.
K. Segerberg, A Completeness Theorem in the Modal Logic of Programs, abstract, Notices of the American Mathematical Society, Oct. 1977.
H. Thiele, Wissenschaftstheoretische Untersuchungen in algorithmischen Sprachen, Berlin, 1966.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rasiowa, H. Algorithmic logic. Multiple-valued extensions. Stud Logica 38, 317–335 (1979). https://doi.org/10.1007/BF00370471
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370471