RUS  ENG
Full version
JOURNALS // Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics] // Archive

Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2021 Issue 1, Pages 59–70 (Mi vtpmk609)

This article is cited in 1 paper

Theoretical Foundations of Computer Science

Truth-table unoids satisfying the Urzyczyn's conditions

D. O. Daderkin

Tver State University, Tver

Abstract: In the works of P. Urzyczyn [1-3] were suggested sufficient conditions of truth-table property of unoids, however, these algebraic conditions of Urzyczyn are difficult to be checked in practice and leave no possibilities to build non-trivial examples of truth-table unoids. In this work concepts of locally-given and divided unoids are proposed, and it is proved that divided unoids satisfy the conditions of Urzyczyn. Thus, simply verifiable sufficient conditions are achieved, on the basis of which unoid, including with enough complicated specified connected underlying set, is truth-table.

Keywords: algebraic system, algebra, unoid, truth-table property, dynamic logics, term.

UDC: 510.6

Received: 26.02.2021
Revised: 15.04.2021

DOI: 10.26456/vtpmk609



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024