Studia Logica 40 (3):289 - 310 (1981)

An algebraic approach to programs called recursive coroutines — due to Janicki [3] — is based on the idea to consider certain complex algorithms as algebraics models of those programs. Complex algorithms are generalizations of pushdown algorithms being algebraic models of recursive procedures (see Mazurkiewicz [4]). LCA — logic of complex algorithms — was formulated in [11]. It formalizes algorithmic properties of a class of deterministic programs called here complex recursive ones or interacting stacks-programs, for which complex algorithms constitute mathematical models. LCA is in a sense an extension of algorithmic logic as initiated by Salwicki [14] and of extended algorithmic logic EAL as formulated and examined by the present author in [8], [9], [10]. In LCA — similarly as in EAL-ω + -valued logic is applied as a tool to construct control systems (stacks) occurring in corresponding algorithms. The aim of this paper is to give a complete axiomatization. of LCA and to prove a completeness theorem.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF02584062
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,564
Through your library

References found in this work BETA

Algorithmic Logic. Multiple-Valued Extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.

Add more references

Citations of this work BETA

Semi-Post Algebras.Nguyen Cat Ho & Helena Rasiowa - 1987 - Studia Logica 46 (2):149 - 160.

Add more citations

Similar books and articles


Added to PP index

Total views
38 ( #302,921 of 2,533,484 )

Recent downloads (6 months)
1 ( #391,480 of 2,533,484 )

How can I increase my downloads?


My notes