Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Mars M. Yamaleev"'
Publikováno v:
The Journal of Symbolic Logic. :1-12
Working toward showing the decidability of the $\forall \exists $ -theory of the ${\Sigma ^0_2}$ -enumeration degrees, we prove that no so-called Ahmad pair of ${\Sigma ^0_2}$ -enumeration degrees can join to ${\mathbf 0}_e'$ .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9b7eda28ee7953d934aa15f31947f76
https://doi.org/10.1017/jsl.2022.84
https://doi.org/10.1017/jsl.2022.84
Publikováno v:
Russian Mathematics. 65:63-69
We examine the relationship between the CEA hierarchy and the Ershov hierarchy within $\Delta_2^0$ Turing degrees. We study the long-standing problem raised in [1] about the existence of a low computably enumerable (c.e.) degree $\bf a$ for which the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5ea72f2f0743502e7c6760fb825514e
https://doi.org/10.3103/s1066369x21080089
https://doi.org/10.3103/s1066369x21080089
Publikováno v:
Algebra and Logic. 59:404-407
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9039c37feac78c5f8663d2a8c68ee638
https://doi.org/10.1007/s10469-020-09613-9
https://doi.org/10.1007/s10469-020-09613-9
Publikováno v:
Lobachevskii Journal of Mathematics. 41:1630-1639
It is well-known that every c.e. Turing degree is the degree of categoricity of a rigid structure. In this work we study the possibility of extension of this result to properly 2-c.e. degrees. We found a condition such that if a $$\Delta^{0}_{2}$$ -d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ee3df4b01e588d51b8bc91c605aa4cd
https://doi.org/10.1134/s1995080220090048
https://doi.org/10.1134/s1995080220090048
Autor:
Mars M. Yamaleev
Publikováno v:
Russian Mathematics. 64:70-73
In this work we consider isolation from side in different degree structures, in particular, in the 2-computably enumerable wtt-degrees and in low Turing degrees. Intuitively, a 2-computably enumerable degree is isolated from side if all computably en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::113ac888e46b913544e6d61c54c5ed7a
https://doi.org/10.3103/s1066369x20080095
https://doi.org/10.3103/s1066369x20080095
Publikováno v:
Lobachevskii Journal of Mathematics. 41:145-150
A standard tool for classifying the complexity of equivalence relations on $$\omega$$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce minimal degre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca65e08a64927fc9ed882a7145fbf9bd
https://doi.org/10.1134/s199508022002002x
https://doi.org/10.1134/s199508022002002x
Publikováno v:
Archive for Mathematical Logic
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this paper, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78cbb264b8cc5b65862750ec79d81816
http://hdl.handle.net/11365/1110348
http://hdl.handle.net/11365/1110348
Publikováno v:
Archive for Mathematical Logic. 58:485-500
A major theme in the study of degree structures of all types has been the question of the decidability or undecidability of their first order theories. This is a natural and fundamental question that is an important goal in the analysis of these stru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df574d43ddfbd89ca97341450de2eb12
https://doi.org/10.1007/s00153-018-0647-y
https://doi.org/10.1007/s00153-018-0647-y
Autor:
Mars M. Yamaleev, V. L. Selivanov
Publikováno v:
Algebra and Logic. 57:222-236
We investigate the problem of characterizing proper levels of the fine hierarchy (up to Turing equivalence). It is known that the fine hierarchy exhausts arithmetical sets and contains as a small fragment finite levels of Ershov hierarchies (relativi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b389ee2c02b90e01c14b3c3cfdd6143
https://doi.org/10.1007/s10469-018-9495-4
https://doi.org/10.1007/s10469-018-9495-4
Autor:
Victor L. Selivanov, Mars M. Yamaleev
Publikováno v:
Computability. 7:289-300
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e895a07ad594ae5ae152ffc5fd590c7
https://doi.org/10.3233/com-180085
https://doi.org/10.3233/com-180085