Geodesic
On Urzyczyn's unoids with a connected underlying set
Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 4 (2019), pp. 117-125
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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, truth-table property, dynamic logics
Mots-clés : unoid, term. 
@article{VTPMK_2019_4_a8,
     author = {D. O. Daderkin},
     title = {On {Urzyczyn's} unoids with a connected underlying set},
     journal = {Vestnik Tverskogo gosudarstvennogo universiteta. Seri\^a Prikladna\^a matematika},
     pages = {117--125},
     year = {2019},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VTPMK_2019_4_a8/}
}
TY  - JOUR
AU  - D. O. Daderkin
TI  - On Urzyczyn's unoids with a connected underlying set
JO  - Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika
PY  - 2019
SP  - 117
EP  - 125
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VTPMK_2019_4_a8/
LA  - ru
ID  - VTPMK_2019_4_a8
ER  - 
%0 Journal Article
%A D. O. Daderkin
%T On Urzyczyn's unoids with a connected underlying set
%J Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika
%D 2019
%P 117-125
%N 4
%U http://geodesic.mathdoc.fr/item/VTPMK_2019_4_a8/
%G ru
%F VTPMK_2019_4_a8
D. O. Daderkin. On Urzyczyn's unoids with a connected underlying set. Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 4 (2019), pp. 117-125. http://geodesic.mathdoc.fr/item/VTPMK_2019_4_a8/

[1] Urzyczyn P., “Algorithmic triviality of abstract structures”, Fundamenta Informaticae, 1981, no. 4, 819–849 | MR | Zbl

[2] Urzyczyn P., “The unwind property in certain algebras”, Information and Control, 50:2 (1981), 91–109 | DOI | MR | Zbl

[3] Urzyczyn P., “Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs”, Foundation of computer theory, Springer-Verlag, Berlin, 1983, 469–504 | MR

[4] Stolboushkin A. P., Tajtslin M. A., “Dynamic logic”, Cybernetics and computing, 1986, no. 2, 180–230 (in Russian) | MR

[5] Tajtslin M. A., “Software Logic Hierarchy”, Siberian Mathematical Journal, XXIV:2 (1983), 184–192 (in Russian)

[6] Dudakov S. M., Karlov B. N., Mathematical Introduction to Computer Science, Tutorial, Tver State University, Tver, 2017, 320 pp. (in Russian)

[7] Kfoury A. J., Urzyczyn P., “Necesseary and sufficient conditions for the universality of programming formalisms”, Acta informatica, 22 (1985), 347–377 | DOI | MR | Zbl

[8] Kfoury A. J., “Definability by deterministic and nondeterministic programs (with applications to first-order dynamic logic)”, Information and Control, 65 (1985), 98–121 | DOI | MR | Zbl

[9] Tiuryn J., “Unbounded program memory adds to the expressive power of first-order programming logic”, Information and Control, 60 (1984), 12–35 | DOI | MR | Zbl

[10] Tiuryn J., Urzyczyn P., “Remarks on comparing expressive power of Logics of Programms”, Mathematical Foundations of Computer Science, v. 176, Lecture Notes in Computer Science, eds. M.P. Chytil, V. Koubek, Springer, Berlin, Heidelberg, 1984 | DOI | MR