Reverse mathematics and properties of finite character

From MaRDI portal
Publication:435197

DOI10.1016/J.APAL.2012.01.007zbMATH Open1253.03032DBLPjournals/apal/DzhafarovM12arXiv1109.3378OpenAlexW2010324947WikidataQ57951146 ScholiaQ57951146MaRDI QIDQ435197FDOQ435197


Authors: Damir D. Dzhafarov, Carl Mummert Edit this on Wikidata


Publication date: 11 July 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1109.3378




Recommendations




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)