Studia Logica 38 (4):317 - 335 (1979)

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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370471
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: 63,393
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

[Omnibus Review].Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):280-281.

Add more references

Citations of this work BETA

On Logic of Complex Algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.

Add more citations

Similar books and articles


Added to PP index

Total views
32 ( #339,710 of 2,448,950 )

Recent downloads (6 months)
1 ( #443,144 of 2,448,950 )

How can I increase my downloads?


My notes