1 citations · 4 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.LO2024
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…
math.LO2024
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…