Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Jun Le Goh"'
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
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
Publikováno v:
The Bulletin of Symbolic Logic. 28:133-149
Theorems of hyperarithmetic analysis (THAs) occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed (recursive) iterations of the Turing jump but below ATR $_{0}$ (and so $\
Publikováno v:
The Journal of Symbolic Logic
In this work we investigate the Weihrauch degree of the problem $\mathsf{DS}$ of finding an infinite descending sequence through a given ill-founded linear order, which is shared by the problem $\mathsf{BS}$ of finding a bad sequence through a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::caa0ce02a1fa6836875abb9fdea3b99d
http://arxiv.org/abs/2010.03840
http://arxiv.org/abs/2010.03840
Autor:
Jun Le Goh
Publikováno v:
The Bulletin of Symbolic Logic. 25:447-448
Autor:
Jun Le Goh
Publikováno v:
Annals of Pure and Applied Logic. 171:102789
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ( ATR 0 ) from the point of view of computability-theoretic reducibilities, in particular Weihrauch reducibility. Our
Publikováno v:
Computability
We study the positions in the Weihrauch lattice of parallel products of various combinatorial principles related to Ramsey's theorem. Among other results, we obtain an answer to a question of Brattka, by showing that Ramsey's theorem for pairs ($\mat