Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Igusa, Gregory"'
We discuss a theorem of Rado: Every r-coloring of the pairs of natural numbers has a path decomposition.
Comment: Updated Oct 4 2017. Our thanks to the readers for their comments. Updated in Dec 2018. The major change was the additional of the S
Comment: Updated Oct 4 2017. Our thanks to the readers for their comments. Updated in Dec 2018. The major change was the additional of the S
Externí odkaz:
http://arxiv.org/abs/1610.03364
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this was alway
Externí odkaz:
http://arxiv.org/abs/1606.00900
Autor:
Cholak, Peter, Igusa, Gregory
We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees: A positive
Externí odkaz:
http://arxiv.org/abs/1512.09057
Autor:
Igusa, Gregory, Towsner, Henry
In \cite{J}, Theorem 4.2, Jockusch proves that for any computable k-coloring of pairs of integers, there is an infinite $\Pi^0_2$ homogeneous set. The proof uses a countable collection of $\Pi^0_2$ sets as potential infinite homogeneous sets. In a re
Externí odkaz:
http://arxiv.org/abs/1507.03256
Autor:
Dzhafarov, Damir, Igusa, Gregory
We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be recovered about
Externí odkaz:
http://arxiv.org/abs/1406.2982
Autor:
Igusa, Gregory
A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory, where it ha
Externí odkaz:
http://arxiv.org/abs/1402.3747
Autor:
Igusa, Gregory
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for every input. T
Externí odkaz:
http://arxiv.org/abs/1202.2560
Publikováno v:
Proceedings of the American Mathematical Society, 2018 Aug 01. 146(8), 3553-3563.
Externí odkaz:
https://www.jstor.org/stable/90022106
Publikováno v:
Proceedings of the American Mathematical Society, 2018 Jul 01. 146(7), 3097-3109.
Externí odkaz:
https://www.jstor.org/stable/90021392
Autor:
CHOLAK, PETER, IGUSA, GREGORY
Publikováno v:
The Journal of Symbolic Logic, 2017 Sep 01. 82(3), 931-957.
Externí odkaz:
https://www.jstor.org/stable/26600267