Show simple item record

dc.contributor.author CUCU, Ion
dc.date.accessioned 2020-11-05T20:19:45Z
dc.date.available 2020-11-05T20:19:45Z
dc.date.issued 2018
dc.identifier.citation CUCU, Ion. On generalization of expressibility in 5-valued logic. In: CAIM 2018: The 26th Conference on Applied and Industrial Mathematics: Book of Abstracts, Technical University of Moldova, September 20-23, 2018. Chişinău: Bons Offices, 2018, p. 92. en_US
dc.identifier.uri http://repository.utm.md/handle/5014/11167
dc.description Only Abstract en_US
dc.description.abstract Let us consider the pseudo-Boolean algebra (M; ∧, ∨, ⊃, ¬), where ⊃ is relative pseudo-complement, and ¬ is pseudo-complement. We say that the system of pseudo-Boolean terms on the set of variables X (Ω – words over X ) is parametrically complete in algebra (M; Ω), if we can parametrically express the operations from Ω via functions expressed by terms over Σ. The function f (x1, ..., xn) of M preserves the predicate (relation) R (x1, ..., xm) if for any possible values xij ∈ M (i = 1, ..., m; j = 1, ..., n) from the truth of R (x11, x21, ..., xn1), ..., R (x1n, x2n, ..., xmn) follows the truth of R (f (x11, x12, ..., x1n), ..., f (xn1, xn2, ..., xnm)). en_US
dc.language.iso en en_US
dc.publisher Bons Offices 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 logic en_US
dc.subject pseudo-Boolean algebra en_US
dc.subject functions en_US
dc.title On generalization of expressibility in 5-valued 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)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Browse

My Account