Showing math.LOShow all
3 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.LO2019
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…
math.LO2019
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…