On Small Types in Univalent Foundations

de Jong, Tom; Escardó, Martín Hötzel

Abstract

We investigate predicative aspects of constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky’s propositional resizing axioms or excluded middle. Our work complements existing work on predicative mathematics by exploring what cannot be done predicatively in univalent foundations. Our first main result is that nontrivial (directed or bounded) complete posets are necessarily large. That is, if such a nontrivial poset is small, then weak propositional resizing holds. It is possible to derive full propositional resizing if we strengthen nontriviality to positivity. The distinction between nontriviality and positivity is analogous to the distinction between nonemptiness and inhabitedness. Moreover, we prove that locally small, nontrivial (directed or bounded) complete posets necessarily lack decidable equality. We prove our results for a general class of posets, which includes e.g. directed complete posets, bounded complete posets, sup-lattices and frames. Secondly, the fact that these nontrivial posets are necessarily large has the important consequence that Tarski’s theorem (and similar results) cannot be applied in nontrivial instances. Furthermore, we explain that generalizations of Tarski’s theorem that allow for large structures are provably false by showing that the ordinal of ordinals in a univalent universe has small suprema in the presence of set quotients. The latter also leads us to investigate the inter-definability and interaction of type universes of propositional truncations and set quotients, as well as a set replacement principle. Thirdly, we clarify, in our predicative setting, the relation between the traditional definition of sup-lattice that requires suprema for all subsets and our definition that asks for suprema of all small families.

Citation

de Jong, T., & Escardó, M. H. (2023). On Small Types in Univalent Foundations. Logical Methods in Computer Science, 19(2), 8:1-8:33. https://doi.org/10.46298/LMCS-19%282%3A8%292023

• Journal Article Type: Article
• Acceptance Date: Mar 27, 2023
• Online Publication Date: May 4, 2023
• Publication Date: May 4, 2023
• Deposit Date: Jul 5, 2023
• Publicly Available Date: Jul 5, 2023
• Journal: Logical Methods in Computer Science
• Print ISSN: 1860-5974
• Electronic ISSN: 1860-5974
• Publisher: Logical Methods in Computer Science
• Peer Reviewed: Peer Reviewed
• Volume: 19
• Issue: 2
• Pages: 8:1-8:33
• DOI: https://doi.org/10.46298/LMCS-19%282%3A8%292023
• Keywords: General Computer Science; Theoretical Computer Science
• Public URL: https://nottingham-repository.worktribe.com/output/22719091
• Publisher URL: https://lmcs.episciences.org/11270