Reverse mathematics and properties of finite character
From MaRDI portal
Publication:435197
Abstract: We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey's lemma is equivalent to the axiom of choice. We study its behavior in the context of second-order arithmetic, where it applies to sets of natural numbers only, and give a full characterization of its strength in terms of the quantifier structure of the formula defining the property. We then study the interaction between properties of finite character and finitary closure operators, and the interaction between these properties and a class of nondeterministic closure operators.
Recommendations
- Characterizing von Neumann regular rings in reverse mathematics
- Reverse mathematics and algebraic field extensions
- Reverse mathematics and fully ordered groups
- Reverse mathematics and semisimple rings
- REVERSE MATHEMATICS OF MF SPACES
- Reverse mathematics and well-ordering principles
- scientific article; zbMATH DE number 2019844
- Reverse Mathematics
- Representations of Reals in Reverse Mathematics
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
Cites work
Cited in
(3)
This page was built for publication: Reverse mathematics and properties of finite character
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435197)