Clarifying ordinals
Logic
2024-08-21 v1
Abstract
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 the join of the complete set relative to each copy separately. Assuming , this is close to optimal; on the other hand, assuming large cardinals the same (and more) holds for every projective functional.
Keywords
Cite
@article{arxiv.2408.10367,
title = {Clarifying ordinals},
author = {Noah Schweber},
journal= {arXiv preprint arXiv:2408.10367},
year = {2024}
}