2000 character limit reached
All uncountable regular cardinals can be inaccessible in HOD
Published 2 Aug 2016 in math.LO | (1608.00732v1)
Abstract: Assuming the existence of a supercompact cardinal and an inaccessible above it, we construct a model of ZFC, in which all uncountable regular cardinals are inaccessible in HOD.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.