Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Asher M. Kach"'
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:
Algebra and Logic. 57:161-165
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f454f0218ce26a1643168515d23341b2
https://doi.org/10.1007/s10469-018-9488-3
https://doi.org/10.1007/s10469-018-9488-3
Publikováno v:
The Journal of Symbolic Logic. 80:116-144
We study the computable structure theory of linear orders of size $\aleph _1 $ within the framework of admissible computability theory. In particular, we characterize which of these linear orders are computably categorical.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::159fa623bcfdd5c9679292a1a9f94861
https://doi.org/10.1017/jsl.2014.68
https://doi.org/10.1017/jsl.2014.68
Publikováno v:
The Journal of Symbolic Logic. 80:145-178
We study the computable structure theory of linear orders of size $\aleph _1 $ within the framework of admissible computability theory. In particular, we study degree spectra and the successor relation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0a8a48aaa6cbee41f71966b7c767eea
https://doi.org/10.1017/jsl.2014.69
https://doi.org/10.1017/jsl.2014.69
Autor:
Steffen Lempp, Andrew Lewis-Pye, Asher M. Kach, Daniel Turetsky, Antonio Montalbán, Rodney G. Downey
Publikováno v:
Advances in Mathematics. 268:423-466
We show that the index set complexity of the computably categorical structures is View the MathML source-complete, demonstrating that computable categoricity has no simple syntactic characterization. As a consequence of our proof, we exhibit, for eve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d86fb83f043e0ac2ce5233a5c9e1204
https://doi.org/10.1016/j.aim.2014.09.022
https://doi.org/10.1016/j.aim.2014.09.022
Autor:
Asher M. Kach, Antonio Montalbán
Publikováno v:
The Journal of Symbolic Logic. 79:1001-1019
Many classes of structures have natural functions and relations on them: concatenation of linear orders, direct product of groups, disjoint union of equivalence structures, and so on. Here, we study the (un)decidability of the theory of several natur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec9e236a8f9810341225bac91897274d
https://doi.org/10.1017/jsl.2014.54
https://doi.org/10.1017/jsl.2014.54
Autor:
Asher M. Kach, Uri Andrews
Publikováno v:
Algebra and Logic. 53:176-183
For a countably categorical theory T, we study the complexity of computing and the complexity of dominating the function specifying the number of n-types consistent with T.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d24d0f6380bb1d6b6701554fa0a303a
https://doi.org/10.1007/s10469-014-9280-y
https://doi.org/10.1007/s10469-014-9280-y
Publikováno v:
Annals of Pure and Applied Logic. 164:822-836
We show that if H is an effectively completely decomposable computable torsion-free abelian group, then there is a computable copy G of H such that G has computable orders but not orders of every (Turing) degree.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cb0d835b4b88fa540729273ef05ef97
https://doi.org/10.1016/j.apal.2013.01.005
https://doi.org/10.1016/j.apal.2013.01.005
Publikováno v:
Fundamenta Mathematicae. 221:129-159
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cf2945ddbf1dce6b8063250fe61764d
https://doi.org/10.4064/fm221-2-2
https://doi.org/10.4064/fm221-2-2
Autor:
Asher M. Kach, Steffen Lempp
Publikováno v:
Algebra universalis. 68:57-74
We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structura
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81489adc13b6b7cf941fd69417c6013e
https://doi.org/10.1007/s00012-012-0188-x
https://doi.org/10.1007/s00012-012-0188-x