Papers
Topics
Authors
Recent
2000 character limit reached

A New Weak Choice Principle

Published 19 Jan 2021 in math.LO | (2101.07840v1)

Abstract: For every natural number $n$ we introduce a new weak choice principle $\mathrm{nRC_{fin}}$: Given any infinite set $x$, there is an infinite subset $y\subseteq x$ and a selection function $f$ that chooses an $n$-element subset from every finite $z\subseteq y$ containing at least $n$ elements. By constructing new permutation models built on a set of atoms obtained as Fra\"iss\'e limits, we will study the relation of $\mathrm{nRC_{fin}}$ to the weak choice principles $\mathrm{RC_m}$ (that has already been studied by Montenegro, Halbeisen and Tachtsis): Given any infinite set $x$, there is an infinite subset $y\subseteq x$ with a choice function $f$ on the family of all $m$-element subsets of $y$. Moreover, we prove a stronger analogue of Montenegros results when we study the relation between $\mathrm{nRC_{fin}}$ and $\mathrm{kC_{fin}-}$ which is defined by: Given any infinite family $\mathcal{F}$ of finite sets of cardinality greater than $k$, there is an infinite subfamily $\mathcal{A}\subseteq \mathcal{F}$ with a selection function $f$ that chooses a $k$-element subset from each $A\in\mathcal{A}$.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.