1 citations · 4 across the 6 of their papers we have counts for
9 papers
Strong reducibilities and set theory
Noah Schweber
We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that…
Clarifying ordinals
Noah Schweber
We use forcing over admissible sets to show that, for every ordinal in a club , there are copies of such that the isomorphism between them is not computable in…
Choiceless Chain Conditions
Asaf Karagila, Noah Schweber
Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing…
Self-full ceers and the uniform join operator
Uri Andrews, Noah Schweber, Andrea Sorbi
A computably enumerable equivalence relation (ceer) is called self-full if whenever is a reduction of to then the range of intersects all -equivalence classe…
The Theory of Ceers Computes True Arithmetic
Uri Andrews, Noah Schweber, Andrea Sorbi
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same…
Effective Localization number: building -surviving degrees
Iván Ongay-Valverde, Noah Schweber
We introduce and study effective versions of the localization numbers introduced by Newelski and Roslanowski (cite in paper). We show that proper hierarchies are produced, and that…