On completeness as to &not;-expressibility in a 4-valued provability logic

Rusu Andrei; Rusu Elena

Articolul precedent

Articolul urmator

820

Ultima descărcare din IBN:
2023-05-31 18:44

SM ISO690:2012

RUSU, 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

On completeness as to ¬-expressibility in a 4-valued provability logic

Pag. 142-145

Rusu Andrei¹², Rusu Elena³

¹ Vladimir Andrunachievici Institute of Mathematics and Computer Science,
² Ovidius University, Constanța,
³ Technical University of Moldova

Disponibil în IBN: 28 noiembrie 2019

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

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-88734</cfResPublId>
<cfResPublDate>2019</cfResPublDate>
<cfStartPage>142</cfStartPage>
<cfISBN>978-9975-68-378-4</cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/88734</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>On completeness as to &not;-expressibility in a 4-valued provability logic</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>Provability logic; expressibility of formulas; completeness relative to ¬-expressibility</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>The simplest non-trivial 4-valued extension GL4 of the propositional provability logic GL is considered together with the notion of &not;-expressibility of formulas in GL. The necessary and sufficient conditions when a system of formulas of GL4 is complete relative to &not;-expressibility are found out which is formulated in terms of classes formulas that are pre-complete relative to &not;-expressibility.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-32760</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-10566</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-32760</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-32760-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFamilyNames>Rusu</cfFamilyNames>
<cfFirstNames>Andrei</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-10566</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-10566-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFamilyNames>Rusu</cfFamilyNames>
<cfFirstNames>Elena</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>