1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
math.LO2014★ 1 cited
Computable structures in generic extensions
Julia Knight, Antonio Montalban, Noah Schweber
In this paper, we investigate connections between structures present in every generic extension of the universe and computability theory. We introduce the notion of {\em generi…