Studia Logica 38 (4):317 - 335 (1979)
Extended algorithmic logic (EAL) as introduced in  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  but no proof of the completeness theorem was given.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Similar books and articles
Algebras of Intervals and a Logic of Conditional Assertions.Peter Milne - 2004 - Journal of Philosophical Logic 33 (5):497-548.
How to Avoid Deviance (in Logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Some Combinatorial and Algorithmic Problems in Many-Valued Logics.Ivan Stojmenović - 1987 - University of Novi Sad, Faculty of Science, Institute of Mathematics.
A Planar Geometrical Model for Representing Multidimensional Discrete Spaces and Multiple-Valued Logic Functions.Ryszard Stanislaw Michalski - 1978 - Dept. Of Computer Science, University of Illinois at Urbana-Champaign.
Many-Place Sequent Calculi for Finitely-Valued Logics.Alexej P. Pynko - 2010 - Logica Universalis 4 (1):41-66.
Added to index2009-01-28
Total downloads14 ( #336,952 of 2,178,245 )
Recent downloads (6 months)1 ( #316,504 of 2,178,245 )
How can I increase my downloads?