Graduate studies at Western
Studia Logica 40 (3):289 - 310 (1981)
|Abstract||An algebraic approach to programs called recursive coroutines — due to Janicki  — 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 ). LCA — logic of complex algorithms — was formulated in . 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  and of extended algorithmic logic EAL as formulated and examined by the present author in , , . 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)|
|Through your library||Configure|
Similar books and articles
Anita Wasilewska (1984). DFC-Algorithms for Suszko Logic and One-to-One Gentzen Type Formalizations. Studia Logica 43 (4):395 - 404.
Peter Turney (1989). The Architecture of Complexity: A New Blueprint. Synthese 79 (3):515 - 542.
Robert R. Korfhage (1966). Logic and Algorithms. New York, Wiley.
Haskell B. Curry (1963/1977). Foundations of Mathematical Logic. Dover Publications.
Wayne Aitken & Jeffrey A. Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Jeffrey Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Vladimir V. Rybakov (2011). Best Unifiers in Transitive Modal Logics. Studia Logica 99 (1-3):321-336.
Christian Huyck & Ian Mitchell (2005). It is Not Evolution, but a Better Game Would Need a Better Agent. Behavioral and Brain Sciences 28 (4):499-500.
Andreas Blass, Nachum Dershowitz & Yuri Gurevich (2009). When Are Two Algorithms the Same? Bulletin of Symbolic Logic 15 (2):145-168.
Helena Rasiowa (1979). Algorithmic Logic. Multiple-Valued Extensions. Studia Logica 38 (4):317 - 335.
Added to index2009-01-28
Total downloads3 ( #213,976 of 739,526 )
Recent downloads (6 months)1 ( #61,778 of 739,526 )
How can I increase my downloads?