|
This article is cited in 2 scientific papers (total in 2 papers)
Theoretical Foundations of Computer Science
On Urzyczyn's unoids with a connected underlying set
D. O. Daderkin Tver State University, Tver
Abstract:
One of the most important properties characterizing the work of a program in an algebraic system is the truth-table property. This work is devoted to the study of some truth-table unoids. The beginning of these studies was initiated by works of P. Urzyczyn, in which sufficient truth-table conditions were proposed. However, the only truth-table unoid known by P.Urzyczyn was the union of an infinite number of pairwise disjoint unoids, each of which is isomorphic to the natural numbers together with the operation of follow. In this work the existence of a truth-table unoid with a connected underlying set is proved, thus showing that the requirement of disjointedness of the underlying set of an unoid is not essential.
Keywords:
algebraic system, algebra, unoid, truth-table property, dynamic logics, term.
Received: 13.09.2019 Revised: 27.09.2019
Citation:
D. O. Daderkin, “On Urzyczyn's unoids with a connected underlying set”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2019, no. 4, 117–125
Linking options:
https://www.mathnet.ru/eng/vtpmk551 https://www.mathnet.ru/eng/vtpmk/y2019/i4/p117
|
Statistics & downloads: |
Abstract page: | 211 | Full-text PDF : | 116 | References: | 42 |
|