Please use this identifier to cite or link to this item: http://cris.utm.md/handle/5014/447
DC FieldValueLanguage
dc.contributor.authorRUSU, Elenaen_US
dc.contributor.authorRUSU, Andreien_US
dc.date.accessioned2020-04-28T13:33:29Z-
dc.date.available2020-04-28T13:33:29Z-
dc.date.issued2019-
dc.identifier.citationRUSU, 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.en_US
dc.identifier.isbn978-9975-68-378-4-
dc.identifier.urihttp://cris.utm.md/handle/5014/447-
dc.description.abstractThe 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.en_US
dc.language.isoenen_US
dc.subjectprovability logicen_US
dc.subjectexpressibility of formulasen_US
dc.subjectcompleteness relative to ¬-expressibilityen_US
dc.titleOn completeness as to ¬-expressibility in a 4-valued provability logicen_US
dc.typeArticleen_US
dc.relation.conferenceConference of Mathematical Society of the Republic of Moldovaen_US
item.grantfulltextopen-
item.languageiso639-1other-
item.fulltextWith Fulltext-
crisitem.author.deptDepartment of Mathematics-
crisitem.author.parentorgFaculty of Mechanical, Industrial Engineering and Transport-
Appears in Collections:Proceedings Papers
Files in This Item:
File Description SizeFormat
142-145_8.pdf558.06 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.