IRTUM – Institutional Repository of the Technical University of Moldova
On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | RUSU, Andrei | |
| dc.contributor.author | RUSU, Elena | |
| dc.date.accessioned | 2020-12-11T14:52:54Z | |
| dc.date.available | 2020-12-11T14:52:54Z | |
| dc.date.issued | 2020 | |
| dc.identifier.citation | 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. | en_US |
| dc.identifier.isbn | 978-9975-68-415-6 | |
| dc.identifier.uri | http://repository.utm.md/handle/5014/12081 | |
| dc.description.abstract | We consider a paraconsistent logic and establish the conditions for a system of its formulas containing paraconsistent negation to be functionally complete in it. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Tipografia "Valinex" | en_US |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.subject | paraconsistent negation | en_US |
| dc.subject | paraconsistent logic | en_US |
| dc.subject | functionally complete systems of formulas | en_US |
| dc.title | On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic | en_US |
| dc.type | Article | en_US |
Files in this item
The following license files are associated with this item:
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States