2000 character limit reached
A class of higher inductive types in Zermelo-Fraenkel set theory
Published 28 May 2020 in math.LO | (2005.14240v2)
Abstract: We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class includes the example of unordered trees of any arity.
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.