CRIS of TUM
Current Research Information System (CRIS) of the Technical University of Moldova (TUM) is an open access system gathering information and digital material relating to the various research and innovation entities and activities of TUM: researchers, research units, publications, patents, thesis, awards, events, equipment, services and other.
Please use this identifier to cite or link to this item:
http://cris.utm.md/handle/5014/447| Title: | On completeness as to ¬-expressibility in a 4-valued provability logic | Authors: | RUSU, Elena RUSU, Andrei |
Keywords: | provability logic;expressibility of formulas;completeness relative to ¬-expressibility | Issue Date: | 2019 | Source: | RUSU, Andrei; RUSU, Elena. On completeness as to ¬-expressibility in a 4-valued provability logic. In: Proceedings IMCS-55The Fifth Conference of Mathematical Society of the Republic of Moldova. 28 septembrie - 1 octombrie 2019, Chișinău. Chișinău, Republica Moldova: Tipografia Valinex, 2019, pp. 142-145. ISBN 978-9975-68-378-4. | Conference: | Conference of Mathematical Society of the Republic of Moldova | Abstract: | 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. |
URI: | http://cris.utm.md/handle/5014/447 | ISBN: | 978-9975-68-378-4 |
| Appears in Collections: | Proceedings Papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 142-145_8.pdf | 558.06 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.