On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic
Închide
Articolul precedent
Articolul urmator
173 2
Ultima descărcare din IBN:
2020-12-28 13:25
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. 4-5 decembrie 2020, Chișinău. Chișinău: Tipografia "Valinex", 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

On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic


Pag. 170-175

Rusu Andrei12, Rusu Elena3
 
1 Institutul de Matematică şi Informatică "Vladimir Andrunachievici",
2 Ovidius University, Constanța,
3 Technical University of Moldova
 
Proiect:
20.80009.5007.22

Sisteme informatice inteligente pentru soluționarea problemelor slab structurate, procesarea cunoștințelor și volumelor mari de date


 
Disponibil în IBN: 10 decembrie 2020


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

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Rusu, A.G.</creatorName>
<affiliation>Institutul de Matematică şi Informatică "Vladimir Andrunachievici", Moldova, Republica</affiliation>
</creator>
<creator>
<creatorName>Rusu, E.</creatorName>
<affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'><p>On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic</p></title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2020</publicationYear>
<relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-9975-68-415-6</relatedIdentifier>
<subjects>
<subject>paraconsistent negation</subject>
<subject>paraconsistent logic</subject>
<subject>functionally complete systems of formulas</subject>
</subjects>
<dates>
<date dateType='Issued'>2020</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><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></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>