Equational Closure and Closure with Respect to Enumeration on a Set of Partial Multivalued Logic Functions
С. С. Марченков, Vasilii A. Prostov
Abstract
С. С. Марченков, Vasilii A. Prostov
Abstract
It is proven that for any k ⩾ 2, operators of equational closure and closure with respect to enumeration (Π-operator) generate one and the same classification on set P k * of partial k -valued logic functions. Thirteen II-precomplete classes are identified in class P 3 *.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is proven that for any k ⩾ 2, operators of equational closure and closure with respect to enumeration (Π-operator) generate one and the same classification on set P k * of partial k -valued logic functions. Thirteen II-precomplete classes are identified in class P 3 *.
Key concepts: Closure (psychology), Enumeration, Closure operator, Mathematics, Set (abstract data type), Operator (biology), Partial function, Class (philosophy)