INDEPENDENCE AND INDUCTION IN REVERSE MATHEMATICS

Read full text
Authors: David Belanger, C. T. Chong, Rupert Hölzl, Frank Stephan
Cited by: 0

Abstract

We continue the project of the study of reverse mathematics principles inspired by cardinal invariants. In this article in particular we focus on principles encapsulating the existence of large families of objects that are in some sense mutually independent. More precisely, we study the principle $\mathsf{MAD}$ stating that a maximal family of pairwise almost disjoint sets exists; and the principle $\mathsf{MED}$ expressing the existence of a maximal family of functions that are pairwise eventually different. We investigate characterisations of and relations between these principles and some of their variants. It turns out that induction strength at the levels of $\mathsf{B}\mathrmΣ_2^0$ or $\mathsf{I}\mathrmΣ_2^0$ is an essential parameter; for instance, over $\mathsf{B}\mathrmΣ_2^0$, we show that $\neg\mathsf{MAD}$ is equivalent to the principle $\mathsf{DOM}$ expressing that every weakly represented family of functions is dominated by some other function.

Fields of Study & Subjects

Computability Logic AI Algorithms Neural Networks and Applications

Publication details

Journal / source
Journal of Symbolic Logic
Publisher
Cambridge University Press (CUP)
Pages
1–11
Publication date
29 January 2026
Language
EN