The program-substitution in algorithmic logic and algorithmic logic with non-deterministic programs

Bulletin of the Section of Logic 13 (2):69-72 (1984)
  Copy   BIBTEX

Abstract

This note presents a point of view upon the notions of programsubstitution which are the tools for proving properties of programs of algorithmic logics [5], [3] being sufficiently strong and universal to comprise almost all previously introduced theories of programming, and the so-called extended algorithmic logic [1], [2] and algorithmic logic with nondeterministic programs [4]. It appears that the mentioned substitution rule allows us to examine more deeply algorithmic properties of terms, formulas and programs. Besides the problem of Post-completeness and structural completeness of algorithmic logics strengthened additionally by the rule of substitution is raised

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,323

External links

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

Through your library

Analytics

Added to PP
2014-01-25

Downloads
53 (#302,735)

6 months
4 (#798,384)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references