| Articolul precedent |
| Articolul urmator |
 |
 808 3 |
| Ultima descărcare din IBN: 2023-05-31 18:44 |
 SM ISO690:2012RUSU, Andrei, RUSU, Elena. On completeness as to ¬-expressibility in a 4-valued provability logic. In: Proceedings IMCS-55: The Fifth Conference of Mathematical Society of the Republic of Moldova, 28 septembrie - 1 octombrie 2019, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2019, pp. 142-145. ISBN 978-9975-68-378-4. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Proceedings IMCS-55 2019 | ||||||
|
Conferința "Conference of Mathematical Society of the Republic of Moldova" Chișinău, Moldova, 28 septembrie - 1 octombrie 2019 | ||||||
|
||||||
| Pag. 142-145 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
The simplest non-trivial 4-valued extension GL4 of the propositional provability logic GL is considered together with the notion of ¬-expressibility of formulas in GL. The necessary and sufficient conditions when a system of formulas of GL4 is complete relative to ¬-expressibility are found out which is formulated in terms of classes formulas that are pre-complete relative to ¬-expressibility. |
||||||
| Cuvinte-cheie Provability logic, expressibility of formulas, completeness relative to ¬-expressibility |
||||||
|
|
|
|
