dc.contributor.author | RUSU, Andrei | |
dc.contributor.author | RUSU, Elena | |
dc.date.accessioned | 2022-01-10T09:08:17Z | |
dc.date.available | 2022-01-10T09:08:17Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | RUSU, Andrei, RUSU, Elena. An algorithm for detection of ultra-weak completeness of the systems of formulas in a provability logic of propositions. In: ROMAI Journal. 2018, V. 14, N. 2, pp. 139–154. ISSN 1841-551, 2065-7714. | en_US |
dc.identifier.issn | 1841-551 | |
dc.identifier.issn | 2065-7714 | |
dc.identifier.uri | http://repository.utm.md/handle/5014/18710 | |
dc.description.abstract | We consider the problem of completeness relative to ultra-weak expressibility of the systems of formulas in the simplest non-trivial extension of the propositional provability logic. We propose an algorithm to address this problem. It is a first step toward investigation of this problem in propositional provability logic. A similar problem was considered by prof. Mefodie Rat¸˘a in the case of the intuitionistic logic. | en_US |
dc.language.iso | en | en_US |
dc.publisher | The Romanian Society of Applied and Industrial Mathematics | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | provability logic | en_US |
dc.subject | logic | en_US |
dc.subject | intuitionistic logic | en_US |
dc.subject | ultra-weak expressibility | en_US |
dc.subject | clones of operations | en_US |
dc.title | An algorithm for detection of ultra-weak completeness of the systems of formulas in a provability logic of propositions | en_US |
dc.type | Article | en_US |
The following license files are associated with this item: