Algorithmic logic. Multiple-valued extensions

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

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,479

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
32 (#367,775)

6 months
1 (#455,463)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On logic of complex algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.

Add more citations

References found in this work

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

Add more references