Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Iskander Sh. Kalimullin"'
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:
The Journal of Symbolic Logic. :1-29
Recall that B is PA relative to A if B computes a member of every nonempty $\Pi ^0_1(A)$ class. This two-place relation is invariant under Turing equivalence and so can be thought of as a binary relation on Turing degrees. Miller and Soskova [23] int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57badee43f03d65cd84c36593fba55df
https://doi.org/10.1017/jsl.2022.55
https://doi.org/10.1017/jsl.2022.55
Publikováno v:
Theoretical Computer Science. 844:195-216
We systematically investigate into the online content of finitely generated structures. The online content of a potentially infinite algebraic or combinatorial structure is perhaps best reflected by its PR-degrees (to be defined). We confirm a natura
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbc4f30c8cb0981ae9d33b9646309aa0
https://doi.org/10.1016/j.tcs.2020.08.021
https://doi.org/10.1016/j.tcs.2020.08.021
Publikováno v:
The Journal of Symbolic Logic. 87:527-544
We give several new characterizations of the continuous enumeration degrees. The main one proves that an enumeration degree is continuous if and only if it is not half of a nontrivial relativized $\mathcal {K}$ -pair. This leads to a structural dicho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c0ee054218848608aca4077bac7afce
https://doi.org/10.1017/jsl.2019.72
https://doi.org/10.1017/jsl.2019.72
Autor:
Asher M. Kach, Antonio Montalbán, V. G. Puzarenko, Iskander Sh. Kalimullin, Marat Kh. Faizrahmanov
Publikováno v:
Mathematical Logic Quarterly. 65:37-45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04bc3c31c5de70cbbe306e9a5e8ee4ad
https://doi.org/10.1002/malq.201800015
https://doi.org/10.1002/malq.201800015
Publikováno v:
The Bulletin of Symbolic Logic. 25:141-181
The survey contains a detailed discussion of methods and results in the new emerging area of online “punctual” structure theory. We also state several open problems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6577eb4e610d00353769c6c813829812
https://doi.org/10.1017/bsl.2019.20
https://doi.org/10.1017/bsl.2019.20
Publikováno v:
The Journal of Symbolic Logic. 83:103-116
A Turing degreedis the degree of categoricity of a computable structure${\cal S}$ifdis the least degree capable of computing isomorphisms among arbitrary computable copies of${\cal S}$. A degreedis the strong degree of categoricity of${\cal S}$ifdis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::810408ce5af99fb6bf595b2f5caf2a73
https://doi.org/10.1017/jsl.2017.70
https://doi.org/10.1017/jsl.2017.70
Publikováno v:
Annals of Pure and Applied Logic. 172:102987
We study punctual categoricity on a cone and intrinsically punctual functions and obtain complete structural characterizations in terms of model-theoretic notions. As a corollary, we answer a question of Bazhenov, Downey, Kalimullin, and Melnikov by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ced28294fec3616479d88aac0d03acc5
https://doi.org/10.1016/j.apal.2021.102987
https://doi.org/10.1016/j.apal.2021.102987
Publikováno v:
Algebra and Logic. 56:171-177
We suggest several new ways to compare fully primitive recursive presentations of a structure. Properties of this kind have never been seen in computable structure theory. We prove that these new de nitions are non-equivalent. In this note we give on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb68982ed6872d6ba1b3a6533f47f782
https://doi.org/10.1007/s10469-017-9437-6
https://doi.org/10.1007/s10469-017-9437-6
Publikováno v:
Theoretical Computer Science. 674:73-98
In this article we suggest a new systematic approach to studying algorithms on algebraic structures via primitive recursion. The approach is designed to fill the gap between abstract computable structure theory and feasible (in the sense of polynomia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41e69ac0ddc6550f4b8e7d286f002a1d
https://doi.org/10.1016/j.tcs.2017.01.029
https://doi.org/10.1016/j.tcs.2017.01.029