Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Mariya I. Soskova"'
Publikováno v:
Computability. 11:269-297
In her 1990 thesis, Ahmad showed that there is a so-called “Ahmad pair”, i.e., there are incomparable Σ 2 0 -enumeration degrees a 0 and a 1 such that every enumeration degree x < a 0 is ⩽ a 1 . At the same time, she also showed that there is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e196d78fdf796700c0be526c51737fd7
https://doi.org/10.3233/com-210380
https://doi.org/10.3233/com-210380
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. :1-21
The tower number ${\mathfrak t}$ and the ultrafilter number $\mathfrak {u}$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of $\omega $ and the almost inclusion relation $\subseteq ^*$ b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::531f24ad945c73ba827eeec87d2917fa
https://doi.org/10.1017/jsl.2022.60
https://doi.org/10.1017/jsl.2022.60
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
Autor:
S. Barry Cooper, Mariya I. Soskova
This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued discourse between researchers from different discip
Autor:
Mariya I. Soskova
Publikováno v:
The Incomputable ISBN: 9783319436678
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d033b68dddb3b98d6bf1507d6ce64273
https://doi.org/10.1007/978-3-319-43669-2_1
https://doi.org/10.1007/978-3-319-43669-2_1