Zobrazeno 1 - 10
of 286
pro vyhledávání: '"GREENBERG, NOAM"'
A longstanding question is to characterize the lattice of supersets (modulo finite sets), $L^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $L^*(A)\cong {E}^*$ the lattice of all c.e. sets. In spite of claims in the lite
Externí odkaz:
http://arxiv.org/abs/2412.01939
We give a new and effective classification of all Borel Wadge classes of subsets of Baire space. This relies on the true stage machinery originally developed by Montalb\'an. We use this machinery to give a new proof of Louveau and Saint-Raymond's sep
Externí odkaz:
http://arxiv.org/abs/2211.07961
Publikováno v:
Bull. symb. log 30 (2024) 199-226
We present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff-Kuratowski and Wadge theorems on the structure of ${\mathbf \Delta}^0_\xi$, Louveau and Saint
Externí odkaz:
http://arxiv.org/abs/2211.07958
Autor:
Downey, Rodney G.1 (AUTHOR) rod.downey@vuw.ac.nz, Greenberg, Noam1 (AUTHOR) greenberg@msor.vuw.ac.nz, Tanggara, Andrew2 (AUTHOR) andrew.tanggara@gmail.com
Publikováno v:
Computability. 2024, Vol. 13 Issue 3/4, p349-361. 13p.
Autor:
Greenberg, Noam, Shelah, Saharon
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing notion for~$\l
Externí odkaz:
http://arxiv.org/abs/2107.05755
Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cousin's lemma for various classes of functions, using Friedman and Simpso
Externí odkaz:
http://arxiv.org/abs/2105.02975
Autor:
Lerman, Tsahi T., Greenberg, Noam, Fishman, Boris, Goldman, Adam, Talmor-Barkan, Yeela, Bauer, Menachem, Goldberg, Idan, Goldberg, Elad, Kornowski, Ran, Krause, Ilan, Levi, Amos, Cohen, Eytan
Publikováno v:
In International Journal of Cardiology 15 February 2024 397
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the collection o
Externí odkaz:
http://arxiv.org/abs/2011.03386
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating $\Pi^0_1$ class of c.e.\ degree. We show that for every c.e.\ degree $\mathbf{c}$, the collection $\{\mathbf{c}, \mathbf{0}'\}$ can
Externí odkaz:
http://arxiv.org/abs/2008.10127