Geodesic
Truth-table unoids satisfying the Urzyczyn's conditions
Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 1 (2021), pp. 59-70
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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

[1] Urzyczyn P., “Algorithmic triviality of abstract structures”, Fundamenta Informaticae, 1981, no. 4, 819–849 | DOI | 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] Dudakov S. M., Karlov B. N., Mathematical Introduction to Computer Science, Tutorial, Tver State University, Tver, 2017, 320 pp. (in Russian)

[6] Daderkin D. O., “On Urzyczyn's Unoids with a Connected Underlying Set”, Herald of Tver State University. Series: Applied Mathematics, 2019, no. 4, 117–125 (in Russian) | DOI

[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