Articolul precedent |
Articolul urmator |
937 3 |
Ultima descărcare din IBN: 2020-10-07 12:04 |
SM ISO690:2012 RUSU, Andrei, RUSU, Elena. On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic. In: Conference of Mathematical Society of the Republic of Moldova, 28 iunie - 2 iulie 2017, Chişinău. Chişinău: Centrul Editorial-Poligrafic al USM, 2017, 4, pp. 153-156. ISBN 978-9975-71-915-5. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Conference of Mathematical Society of the Republic of Moldova 4, 2017 |
|||||||
Conferința "Conference of Mathematical Society of the Republic of Moldova" Chişinău, Moldova, 28 iunie - 2 iulie 2017 | |||||||
|
|||||||
Pag. 153-156 | |||||||
|
|||||||
Descarcă PDF | |||||||
Rezumat | |||||||
We consider the well-known 3-valued extension of the intuitionistic propositional logic [1] and examine the conditions for o system of formulas to be complete with respect to existential expressibility of formulas considered earlier by A. V. Kuznetsov [2]. It was established that there exists a relative simple algorithm to determine whether a system of formulas is complete relative to existential expressibility of formulas in the 3-valued extension of the intuitionistic propositional logic. |
|||||||
Cuvinte-cheie Intuitionistic logic, existential expressibility, super-intuitionistic logic |
|||||||
|
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-54571</cfResPublId> <cfResPublDate>2017</cfResPublDate> <cfVol>4</cfVol> <cfStartPage>153</cfStartPage> <cfISBN>978-9975-71-915-5</cfISBN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/54571</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Intuitionistic logic; existential expressibility; super-intuitionistic logic</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'>We consider the well-known 3-valued extension of the intuitionistic propositional logic [1] and examine the conditions for o system of formulas to be complete with respect to existential expressibility of formulas considered earlier by A. V. Kuznetsov [2]. It was established that there exists a relative simple algorithm to determine whether a system of formulas is complete relative to existential expressibility of formulas in the 3-valued extension of the intuitionistic propositional logic. </cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2017T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2017T24: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>2017T24: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>2017T24: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>2017T24: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>2017T24:00:00</cfStartDate> <cfFamilyNames>Rusu</cfFamilyNames> <cfFirstNames>Elena</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>