dc.contributor.author | RUSU, Andrei | |
dc.contributor.author | RUSU, Elena | |
dc.date.accessioned | 2020-11-05T22:47:18Z | |
dc.date.available | 2020-11-05T22:47:18Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | RUSU, Andrei, RUSU, Elena. On weak expressibility of formulas in the simplest non-trivial propositional provability logic. In: CAIM 2018: The 26th Conference on Applied and Industrial Mathematics: Book of Abstracts, Technical University of Moldova, September 20-23, 2018. Chişinău: Bons Offices, 2018, p. 100. | en_US |
dc.identifier.uri | http://repository.utm.md/handle/5014/11176 | |
dc.description | Only Abstract | en_US |
dc.description.abstract | They say formula F is weak-expressible by formulas of the system Σ in the logic L if F can be obtained from unary formulas of L and from formulas of Σ by applying the rule of weak substitution (which allows to pass from the formulas A and B to the result of the substitution of one of them in another one instead of all occurrences of the same variable, say p) and by the rule of replacement by an equivalent formula (which permit to pass from the formula A to an equivalent to it in L formula B). | en_US |
dc.language.iso | en | en_US |
dc.publisher | Bons Offices | 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 | propositional provability logic | en_US |
dc.subject | weak expressibility | en_US |
dc.subject | formulas | en_US |
dc.subject | system of formulas | en_US |
dc.title | On weak expressibility of formulas in the simplest non-trivial propositional provability logic | en_US |
dc.type | Article | en_US |
The following license files are associated with this item: