Number theoretic results related to the axioms of choice for finite sets (Q2532801)

[Joint review for Matematiche 23 (1968), 496--500 (1969; Zbl 0175.00703).] \[\] For each natural number \(n\) let \(C\{n\}\) be the following statement of set theory: ``For every set \(X\) whose elements are \(n\)-element sets, there is a mapping \(f\) defined on \(X\) such that \(f(x)\in x\) for all \(x\in X\).'' If \(Z\) is a finite set of natural numbers, let \(C\{Z\}\) denote the conjunction of the statements \(C\{z\}\) for \(z\in Z\). Mostowski introduced these axioms of choice for finite sets; he investigated the problem of which implications of the form \(C\{n\}\Rightarrow C\{n\}\) are valid in a Gödel-Bernays type set theory (without the axiom of choice). Both papers are concerned with such implications. In the first of the two papers, the author strengthens some of Mostowski's conclusions by giving estimates for the number \(\mu(n)\), the greatest prime \(p\) such that \(n\) is expressible as the sum of primes greater than \(p\). The principal tool is a modified version of Bertrand's postulate which says that for real \(x>7/2\) there is a prime \(p\) satisfying \(x<p<2x - 2\). In the second of the two papers, the author extends a theorem of Sierpiński.