Archive for Mathematical Logic 59 (5-6):583-606 (2020)

Abstract
For an integer \, Ramsey Choice\ is the weak choice principle “every infinite setxhas an infinite subset y such that\ has a choice function”, and \ is the weak choice principle “every infinite family of n-element sets has an infinite subfamily with a choice function”. In 1995, Montenegro showed that for \, \. However, the question of whether or not \ for \ is still open. In general, for distinct \, not even the status of “\” or “\” is known. In this paper, we provide partial answers to the above open problems and among other results, we establish the following:1.For every integer \, if \ is true for all integers i with \, then \ is true for all integers i with \.2.If \ are any integers such that for some prime p we have \ and \, then in \: \ and \.3.For \, \\\ implies \, and \ implies neither \ nor \ in \.4.For every integer \, \ implies “every infinite linearly orderable family of k-element sets has a partial Kinna–Wagner selection function” and the latter implication is not reversible in \ ). In particular, \ strictly implies “every infinite linearly orderable family of 3-element sets has a partial choice function”.5.The Chain-AntiChain Principle implies neither \ nor \ in \, for every integer \.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
ISBN(s)
DOI 10.1007/s00153-019-00705-7
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 60,021
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Ramsey's Theorem in the Hierarchy of Choice Principles.Andreas Blass - 1977 - Journal of Symbolic Logic 42 (3):387-390.
The Independence of Ramsey's Theorem.E. M. Kleinberg - 1969 - Journal of Symbolic Logic 34 (2):205-206.
Finite Axioms of Choice.John Truss - 1973 - Annals of Mathematical Logic 6 (2):147.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Non-Fregean Propositional Logic with Quantifiers.Joanna Golińska-Pilarek & Taneli Huuskonen - 2016 - Notre Dame Journal of Formal Logic 57 (2):249-279.
Bounded Martin’s Maximum with an Asterisk.David Asperó & Ralf Schindler - 2014 - Notre Dame Journal of Formal Logic 55 (3):333-348.
A Nonstandard Counterpart of WWKL.Stephen G. Simpson & Keita Yokoyama - 2011 - Notre Dame Journal of Formal Logic 52 (3):229-243.
A Note on da Costa-Doria “Exotic Formalizations”.L. Gordeev - 2010 - Archive for Mathematical Logic 49 (7-8):813-821.
Around Splitting and Reaping for Partitions of Ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
On Interpretability in the Theory of Concatenation.Vítězslav Švejdar - 2009 - Notre Dame Journal of Formal Logic 50 (1):87-95.
A Variant of Mathias Forcing That Preserves {\ Mathsf {ACA} _0}.François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.
Beneš’s Partial Model of $Mathsf {NF}$: An Old Result Revisited.Edoardo Rivello - 2014 - Notre Dame Journal of Formal Logic 55 (3):397-411.
Rudimentary Recursion, Gentle Functions and Provident Sets.A. R. D. Mathias & N. J. Bowler - 2015 - Notre Dame Journal of Formal Logic 56 (1):3-60.
Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.

Analytics

Added to PP index
2019-12-06

Total views
5 ( #1,153,001 of 2,433,543 )

Recent downloads (6 months)
1 ( #468,801 of 2,433,543 )

How can I increase my downloads?

Downloads

My notes