2019Moscow University Computational Mathematics and CyberneticsRequires access

Equational Closure and Closure with Respect to Enumeration on a Set of Partial Multivalued Logic Functions

С. С. Марченков, Vasilii A. Prostov

Open publisher page 0 citations

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 *.

About this research paper

What this paper is about

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 *.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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 *.

Key concepts: Closure (psychology), Enumeration, Closure operator, Mathematics, Set (abstract data type), Operator (biology), Partial function, Class (philosophy)

Related papers

Back to paper searchBrowse research topicsOriginal source
Equational Closure and Closure with Respect to Enumeration on a Set of Partial Multivalued Logic Functions — Research Paper | ScholarLens