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

Rusu Andrei; Rusu Elena

Articolul precedent

Articolul urmator

485

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

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

Pag. 170-175

Rusu Andrei¹², Rusu Elena³

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

Proiecte:

Menționat în lucrare: 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

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

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'>
<dc:creator>Rusu, A.G.</dc:creator>
<dc:creator>Rusu, E.</dc:creator>
<dc:date>2020</dc:date>
<dc:description xml:lang='en'><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></dc:description>
<dc:source>International Conference on Intelligent Information Systems () 170-175</dc:source>
<dc:subject>paraconsistent negation</dc:subject>
<dc:subject>paraconsistent logic</dc:subject>
<dc:subject>functionally complete systems of formulas</dc:subject>
<dc:title>On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>