Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Uri Andrews"'
Autor:
Melnikov, Alexander G.
Publikováno v:
The Bulletin of Symbolic Logic, 2013 Sep 01. 19(3), 400-401.
Externí odkaz:
https://www.jstor.org/stable/41955419
Autor:
Alexander G. Melnikov
Publikováno v:
The Bulletin of Symbolic Logic. 19:400-401
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::885683ed79abf3b8b92466bc5735591b
https://doi.org/10.1017/s1079898600010726
https://doi.org/10.1017/s1079898600010726
Publikováno v:
The Journal of Symbolic Logic. :1-20
We study the relative computational power of structures related to the ordered field of reals, specifically using the notion of generic Muchnik reducibility. We show that any expansion of the reals by a continuous function has no more computing power
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a57b777245c78b92ee450d261cd232c
https://doi.org/10.1017/jsl.2022.66
https://doi.org/10.1017/jsl.2022.66
Autor:
Omer Mermelstein, Uri Andrews
Publikováno v:
Proceedings of the American Mathematical Society. 150:381-395
We show that for a model complete strongly minimal theory whose pregeometry is flat, the recursive spectrum (SRM($T$)) is either of the form $[0,\alpha)$ for $\alpha\in \omega+2$ or $[0,n]\cup\{\omega\}$ for $n\in \omega$, or $\{\omega\}$, or contain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb491d0f4a36c93c040e6bcc9514243e
https://doi.org/10.1090/proc/15613
https://doi.org/10.1090/proc/15613
The first-order theory of the computably enumerable equivalence relations in the uncountable setting
Publikováno v:
Journal of Logic and Computation. 32:98-114
We generalize the analysis of Andrews, Schweber and Sorbi of the first-order theory of the partial order of degrees of c.e. equivalence relations to higher computability theory, specifically to the setting of a regular cardinal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1cc583527befbd75dbcf950b080e0d99
https://doi.org/10.1093/logcom/exab045
https://doi.org/10.1093/logcom/exab045
Publikováno v:
Logic Journal of the IGPL. 30:499-518
Combinatorial operations on sets are almost never well defined on Turing degrees, a fact so obvious that counterexamples are worth exhibiting. The case we focus on is the symmetric-difference operator; there are pairs of (nonzero) degrees for which t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a5b918ce53084cb2ad1860525d2490c
https://doi.org/10.1093/jigpal/jzab017
https://doi.org/10.1093/jigpal/jzab017
Autor:
Omer Mermelstein, Uri Andrews
Publikováno v:
The Journal of Symbolic Logic. 86:1632-1656
We build a new spectrum of recursive models ( $ \operatorname {\mathrm {SRM}}(T)$ ) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09658889402596e02590b498fef26964
https://doi.org/10.1017/jsl.2021.11
https://doi.org/10.1017/jsl.2021.11
Publikováno v:
Journal of Logic and Computation. 30:765-783
A computably enumerable equivalence relation (ceer) $X$ is called self-full if whenever $f$ is a reduction of $X$ to $X$, then the range of $f$ intersects all $X$-equivalence classes. It is known that the infinite self-full ceers properly contain the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8ad77645cdf0a3a66c43157d206739d
https://doi.org/10.1093/logcom/exaa023
https://doi.org/10.1093/logcom/exaa023
Publikováno v:
Archive for Mathematical Logic. 59:743-754
In the paper "Randomizations of Scattered Sentences", Keisler showed that if Martin's axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone. We show he
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b097714819b77244e58f23f97f9ebba6
https://doi.org/10.1007/s00153-020-00718-7
https://doi.org/10.1007/s00153-020-00718-7
Autor:
URI ANDREWS, ANDREA SORBI
It is known that every non-universal self-full degree in the structure of the degrees of computably enumerable equivalence relations (ceers) under computable reducibility has exactly one strong minimal cover. This leaves little room for embedding wid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2690d80fdf45ab9696a97d030cabff15
https://hdl.handle.net/11365/1205016
https://hdl.handle.net/11365/1205016
