|
This article is cited in 1 scientific paper (total in 1 paper)
Spectral universality of linear orders with one binary relation
M. V. Zubkova, A. N. Frolovb a Kazan (Volga Region) Federal University
b Higher Institute for Information Technology and Information Systems, Kazan Federal University
Abstract:
We show the spectral universality of the class of structures that are linear orders with an additional binary relation and hence with an $n$-ary relation for each $n \ge 2$. To this end, we study the category of the structures. We then obtain some other algorithmic properties of the category by using the notion of a computable functor which was studied in recent papers by other authors.
Keywords:
computable linear order, spectral universality, binary relation.
Received: 25.12.2018 Revised: 10.01.2020 Accepted: 08.04.2020
Citation:
M. V. Zubkov, A. N. Frolov, “Spectral universality of linear orders with one binary relation”, Sibirsk. Mat. Zh., 61:3 (2020), 587–593; Siberian Math. J., 61:3 (2020), 463–467
Linking options:
https://www.mathnet.ru/eng/smj6002 https://www.mathnet.ru/eng/smj/v61/i3/p587
|
Statistics & downloads: |
Abstract page: | 168 | Full-text PDF : | 69 | References: | 26 | First page: | 1 |
|