Skip navigation

Please use this identifier to cite or link to this item:
Title: The program-substitution in algorithmic logic and algorithmic logic with non-deterministic programs
Authors: Biela, Andrzej
Keywords: algorithmic logic; non-deterministic programs; theories of programming
Issue Date: 1984
Citation: Bulletin of the Section of Logic, Vol. 13, no. 2 (1984), s. 69-72
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 non- deterministic 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 (Fragment tekstu).
ISSN: 2449-836X
Appears in Collections:Artykuły (WNŚiT)

Files in This Item:
File Description SizeFormat 
Biela_The_program_substitution.pdf219,07 kBAdobe PDFView/Open
Show full item record

Uznanie autorstwa - użycie niekomercyjne, bez utworów zależnych 3.0 Polska Creative Commons License Creative Commons