On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic
Închide
Articolul precedent
Articolul urmator
129 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 Vladimir Andrunakievich Institute of Mathematics and Computer Science,
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