Articolul precedent |
Articolul urmator |
486 4 |
Ultima descărcare din IBN: 2023-09-10 08:21 |
SM ISO690:2012 RUSU, Andrei, RUSU, Elena. On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic. In: International Conference on Intelligent Information Systems, Ed. 2020, 4-5 decembrie 2020, Chișinău. Chișinău: "VALINEX" SRL, 2020, pp. 170-175. ISBN 978-9975-68-415-6. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
International Conference on Intelligent Information Systems 2020 | |||||||
Conferința "International Conference on Intelligent Information Systems" 2020, Chișinău, Moldova, 4-5 decembrie 2020 | |||||||
|
|||||||
Pag. 170-175 | |||||||
|
|||||||
Descarcă PDF | |||||||
Rezumat | |||||||
We consider a paraconsistent logic and establish the conditions for a system of its formulas containing paraconsistent negation to be functionally complete in it. |
|||||||
Cuvinte-cheie paraconsistent negation, paraconsistent logic, functionally complete systems of formulas |
|||||||
|
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-116217</cfResPublId> <cfResPublDate>2020</cfResPublDate> <cfStartPage>170</cfStartPage> <cfISBN>978-9975-68-415-6</cfISBN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/116217</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>paraconsistent negation; paraconsistent logic; functionally complete systems of formulas</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>We consider a paraconsistent logic and establish the conditions for a system of its formulas containing paraconsistent negation to be functionally complete in it.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2020T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2020T24: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>2020T24: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>2020T24: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>2020T24: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>2020T24:00:00</cfStartDate> <cfFamilyNames>Rusu</cfFamilyNames> <cfFirstNames>Elena</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>