Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Noam Greenberg"'
Autor:
NOAM GREENBERG, BENOIT MONIN
Publikováno v:
Forum of Mathematics, Sigma, Vol 5 (2017)
We use concepts of continuous higher randomness, developed in Bienvenu et al. [‘Continuous higher randomness’, J. Math. Log. 17(1) (2017).], to investigate $\unicode[STIX]{x1D6F1}_{1}^{1}$ -randomness. We discuss lowness for $\unicode[STIX]{x1D6
Externí odkaz:
https://doaj.org/article/70556b86d10345c6848aa2a74afe7466
Publikováno v:
Forum of Mathematics, Sigma, Vol 4 (2016)
We construct an increasing ${\it\omega}$ -sequence $\langle \boldsymbol{a}_{n}\rangle$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each $\boldsymbol{a}_{n+1}$ is diagonally nonrecursive relative to $\bolds
Externí odkaz:
https://doaj.org/article/df7c675e641a43db98c92f317dd5854e
Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods – some old, some new – that have extended its basic concepts to uncountable structures. Unlike in the classical case, howeve
Publikováno v:
Oberwolfach Reports. 18:1149-1190
Publikováno v:
Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ISBN: 9789811278624
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a23a90588cc0ebf353c389d40bf7e13a
https://doi.org/10.1142/13479
https://doi.org/10.1142/13479
Publikováno v:
Proceedings of the American Mathematical Society, Series B. 9:111-124
Autor:
Ilan Krause, Ili Margalit, Noam Greenberg, Elad Goldberg, Tzippy Shochat, Moran Hellerman Itzhaki
Publikováno v:
Journal of Investigative Medicine. 69:1404-1410
Direct oral anticoagulants (DOACs) have become the treatment of choice in thromboembolism prophylaxis for non-valvular atrial fibrillation, surpassing warfarin. While interruption of DOAC therapy for various reasons is a common eventuality, the body
Publikováno v:
New Zealand Journal of Mathematics. 52:175-231
A transfinite hierarchy of Turing degrees of c.e.\ sets has been used to calibrate the dynamics of families of constructions in computability theory, and yields natural definability results. We review the main results of the area, and discuss splitti
Publikováno v:
Computability. 10:181-214
In (A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (2020), Annals of Mathematics Studies, Princeton University Press), Downey and Greenberg de
Publikováno v:
Lobachevskii Journal of Mathematics. 42:693-700
An $$\alpha$$ -coloring $$\xi$$ of a structure $$\mathcal{S}$$ is distinguishing if there are no nontrivial automorphisms of $$\mathcal{S}$$ respecting $$\xi$$ . In this note we prove several results illustrating that computing the distinguishing num