DC pole | Wartość | Język |
dc.contributor.author | Biela, Andrzej | - |
dc.date.accessioned | 2020-09-18T10:26:58Z | - |
dc.date.available | 2020-09-18T10:26:58Z | - |
dc.date.issued | 1984 | - |
dc.identifier.citation | Bulletin of the Section of Logic, Vol. 13, no. 2 (1984), s. 69-72 | pl_PL |
dc.identifier.issn | 2449-836X | - |
dc.identifier.issn | 0138-0680 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12128/16004 | - |
dc.description.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). | pl_PL |
dc.language.iso | en | pl_PL |
dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/pl/ | * |
dc.subject | algorithmic logic | pl_PL |
dc.subject | non-deterministic programs | pl_PL |
dc.subject | theories of programming | pl_PL |
dc.title | The program-substitution in algorithmic logic and algorithmic logic with non-deterministic programs | pl_PL |
dc.type | info:eu-repo/semantics/article | pl_PL |
Pojawia się w kolekcji: | Artykuły (WNŚiT)
|