Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Julia F. Knight"'
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
Publikováno v:
The Journal of Symbolic Logic. 87:1201-1214
We ask when, for a pair of structures $\mathcal {A}_1,\mathcal {A}_2$ , there is a uniform effective procedure that, given copies of the two structures, unlabeled, always produces a copy of $\mathcal {A}_1$ . We give some conditions guaranteeing that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d40cf4daf8d51487db2ed8673e6f7978
https://doi.org/10.1017/jsl.2021.89
https://doi.org/10.1017/jsl.2021.89
Autor:
K. Lange, Julia F. Knight
Publikováno v:
Algebra and Logic. 60:95-107
Let K be an algebraically closed field of characteristic 0, and let G be a divisible ordered Abelian group. Maclane [Bull. Am. Math. Soc., 45, 888-890 (1939)] showed that the Hahn field K((G)) is algebraically closed. Our goal is to bound the lengths
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a6a600497ddfb97104d4e3eba4c0de3
https://doi.org/10.1007/s10469-021-09632-0
https://doi.org/10.1007/s10469-021-09632-0
Autor:
Karen Lange, Julia F. Knight
Publikováno v:
Trends in Logic ISBN: 9783030302283
Let G be a divisible ordered Abelian group, and let K be a field. The Hahn field K((G)) is a field of formal power series, with terms corresponding to elements in a well ordered subset of G and the coefficients coming from K. Ideas going back to Newt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83339e239abb2d8849d03174cc5be9b5
https://doi.org/10.1007/978-3-030-30229-0_5
https://doi.org/10.1007/978-3-030-30229-0_5
Autor:
Valentina S. Harizanov, Alexandra A. Soskova, Stefan V. Vatev, Wesley Calvert, A. N. Frolov, Julia F. Knight, Charles F. D. McCoy
Publikováno v:
Journal of Logic and Computation. 28:1499-1522
We say that a structure $\mathcal{A}$ admits \emph{strong jump inversion} provided that for every oracle $X$, if $X'$ computes $D(\mathcal{C})'$ for some $\mathcal{C}\cong\mathcal{A}$, then $X$ computes $D(\mathcal{B})$ for some $\mathcal{B}\cong\mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b83f8f504e289d1b390c34bf3884f2e
https://doi.org/10.1093/logcom/exy025
https://doi.org/10.1093/logcom/exy025
Publikováno v:
The Journal of Symbolic Logic. 83:529-550
This article contributes to the general program of extending techniques and ideas of effective algebra to computable metric space theory. It is well-known that relative computable categoricity (to be defined) of a computable algebraic structure is eq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c9dfb2b3a0d07b6bd9d19164b8fd9e9
https://doi.org/10.1017/jsl.2017.91
https://doi.org/10.1017/jsl.2017.91
Autor:
Uri Andrews, Julia F. Knight
Publikováno v:
Journal of the European Mathematical Society. 20:1561-1594
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d971ddd8d9454e67c326c613fc73f57
https://doi.org/10.4171/jems/793
https://doi.org/10.4171/jems/793
Publikováno v:
Proceedings of the American Mathematical Society. 146:3097-3109
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank ω 1 C K \omega _1^{CK} , the computable infinitary theory is ℵ 0 \aleph _0 -categorical. Millar and Sacks asked whether
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4cf45892619de1d9f552c4aa01c6708
https://doi.org/10.1090/proc/13967
https://doi.org/10.1090/proc/13967
Autor:
Vikram Saraph, Julia F. Knight
Publikováno v:
Archive for Mathematical Logic. 57:453-472
We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of finite rank. Fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99a0b3a45d2eb75c0c76abad00d18392
https://doi.org/10.1007/s00153-017-0578-z
https://doi.org/10.1007/s00153-017-0578-z
Publikováno v:
The Journal of Symbolic Logic. 82:137-150
In [8], the third author defined a reducibility$\le _w^{\rm{*}}$that lets us compare the computing power of structures of any cardinality. In [6], the first two authors showed that the ordered field of reals${\cal R}$lies strictly above certain relat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db9276203cec5e2a466b68593aeca944
https://doi.org/10.1017/jsl.2016.55
https://doi.org/10.1017/jsl.2016.55