# Finiteness classes arising from Ramsey-theoretic statements in set theory without choice

@article{Brot2021FinitenessCA, title={Finiteness classes arising from Ramsey-theoretic statements in set theory without choice}, author={Joshua Brot and Mengyang Cao and David J. Fern{\'a}ndez-Bret{\'o}n}, journal={Ann. Pure Appl. Log.}, year={2021}, volume={172}, pages={102961} }

## Figures from this paper

## One Citation

### Hindman's Theorem in the hierarchy of Choice Principles

- Economics
- 2022

In the context of ZF, 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…

## References

SHOWING 1-10 OF 40 REFERENCES

### Strongly Amorphous Sets and Dual Dedekind Infinity

- MathematicsMath. Log. Q.
- 1997

1. If A is strongly amorphous (i.e., all relations on A are definable), then its power set P(A) is dually Dedekind infinite, i. e., every function from P(A) onto P(A) is injective. 2. The class of…

### A Note on Hindman-Type Theorems for Uncountable Cardinals

- MathematicsOrder
- 2019

It is shown how a family of natural Hindman-type theorems for uncountable cardinals can be obtained by adapting some recent results of the author from their original countable setting.

### Finite Sums from Sequences Within Cells of a Partition of N

- MathematicsJ. Comb. Theory, Ser. A
- 1974

### Ramsey's theorem in the hierarchy of choice principles

- Mathematics, EconomicsJournal of Symbolic Logic
- 1977

This paper proves or refute the provability of each of the possible implications between Ramsey's theorem and the weak axioms of choice mentioned in Appendix A.3 of Jech's book.

### Open Problems in Partition Regularity

- MathematicsCombinatorics, Probability and Computing
- 2003

The aim in this paper is to present some of the natural and appealing open problems in the area of partition regularity in the infinite case.

### On a Certain Notion of Finite and a Finiteness Class in Set Theory without Choice

- Mathematics
- 2015

The classical definition of a finite set is that a set X is finite if there exists a bijection f : X → n where n is a natural number (n = {m ∈ ω : m < n}, where as usual ω denotes the set of all…

### The Finite and the Infinite

- MathematicsAppl. Categorical Struct.
- 2011

The shrinking principle for families (Xi)i ∈ I of sets, indexed by a Dedekind-finite set I (i.e., there exists a family (Yi) i’i’s’I of pairwise disjoint subsets Yi of Xi with $\underset{i\in I}{\bigcup} Y_i = \underset {i\ in I} X_i$).

### Choiceless Ramsey Theory of Linear Orders

- MathematicsOrder
- 2017

A series of negative partition relations with finite exponents for the linear orders 〈α2,<lex〉, where α is an infinite ordinal and <lex is the lexicographical order are proved.

### THE AXIOM OF CHOICE

- Mathematics
- 2003

We propose that failures of the axiom of choice, that is, surjective functions admitting no sections, can be reasonably classified by means of invariants borrowed from algebraic topology. We show…