Antichain of ordinals in intuitionistic set theory

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Wang, Shuwei
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914595530080256
author Wang, Shuwei
author_facet Wang, Shuwei
contents In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In this paper, we shall show that starting from two incomparable ordinals, one can construct canonical bijections from any arbitrary set to an antichain of ordinals, and consequently any subset of the given set can be defined using ordinals as parameters. This implies the surprising result that in the theory "$\mathrm{IKP} + {}$there exist two incomparable ordinals", the statements $\mathrm{Ord} \subseteq L$ and $V = L$ are equivalent.
format Preprint
id arxiv_https___arxiv_org_abs_2510_18859
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Antichain of ordinals in intuitionistic set theory
Wang, Shuwei
Logic
Primary: 03E70, Secondary: 03E10, 03F55
In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In this paper, we shall show that starting from two incomparable ordinals, one can construct canonical bijections from any arbitrary set to an antichain of ordinals, and consequently any subset of the given set can be defined using ordinals as parameters. This implies the surprising result that in the theory "$\mathrm{IKP} + {}$there exist two incomparable ordinals", the statements $\mathrm{Ord} \subseteq L$ and $V = L$ are equivalent.
title Antichain of ordinals in intuitionistic set theory
topic Logic
Primary: 03E70, Secondary: 03E10, 03F55
url https://arxiv.org/abs/2510.18859