Hindman’s theorem in the hierarchy of choice principles

Journal of Mathematical Logic 24 (1) (2023)
  Copy   BIBTEX

Abstract

In the context of [Formula: see text], we analyze a version of Hindman’s finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various classical weak choice principles, thus precisely locating the strength of the statement as a weak form of the [Formula: see text].

Categories

Keywords

Reprint years

2024

DOI

10.1142/s0219061323500022

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,323

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem.Lorenzo Carlucci - 2018 - Archive for Mathematical Logic 57 (3-4):381-389.
Hilbert versus Hindman.Jeffry L. Hirst - 2012 - Archive for Mathematical Logic 51 (1-2):123-125.
A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.
Hindman’s theorem, ultrafilters, and reverse mathematics.Jeffry L. Hirst - 2004 - Journal of Symbolic Logic 69 (1):65-72.
Hindman's theorem: An ultrafilter argument in second order arithmetic.Henry Towsner - 2011 - Journal of Symbolic Logic 76 (1):353 - 360.
Ramsey Algebras and Formal Orderly Terms.Wen Chean Teh - 2017 - Notre Dame Journal of Formal Logic 58 (1):115-125.
Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$ Σ 2 0 -induction and the Pigeonhole principle for trees. [REVIEW]Lorenzo Carlucci & Daniele Tavernelli - 2022 - Archive for Mathematical Logic 61 (5):827-839.
Ramsey's theorem in the hierarchy of choice principles.Andreas Blass - 1977 - Journal of Symbolic Logic 42 (3):387-390.
Ramsey algebras.Wen Chean Teh - 2016 - Journal of Mathematical Logic 16 (2):1650005.
Prenex normal form theorems in semi-classical arithmetic.Makoto Fujiwara & Taishi Kurahashi - 2021 - Journal of Symbolic Logic 86 (3):1124-1153.
Ramsey’s coheirs.Eugenio Colla & Domenico Zambella - 2022 - Journal of Symbolic Logic 87 (1):377-391.
Jump Theorems for REA Operators.Alistair H. Lachlan & Xiaoding Yi - 1993 - Mathematical Logic Quarterly 39 (1):1-6.
Other Proofs of Old Results.Henryk Kotlarski - 1998 - Mathematical Logic Quarterly 44 (4):474-480.
The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective.Wim Veldman - 2008 - Journal of Symbolic Logic 73 (1):1-64.
Ramsey algebras and the existence of idempotent ultrafilters.Wen Chean Teh - 2016 - Archive for Mathematical Logic 55 (3-4):475-491.

Analytics

Added to PP
2023-02-10

Downloads
6 (#1,466,578)

6 months
3 (#984,214)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Ramsey's theorem in the hierarchy of choice principles.Andreas Blass - 1977 - Journal of Symbolic Logic 42 (3):387-390.
Some Aspects and Examples of Infinity Notions.J. W. Degen - 1994 - Mathematical Logic Quarterly 40 (1):111-124.

View all 9 references / Add more references