Thin Set Versions of Hindman’s Theorem
نویسندگان
چکیده
We examine the reverse mathematical strength of a variation Hindman’s Theorem (HT) constructed by essentially combining HT with Thin Set to obtain principle that we call thin-HT. This states every coloring c:N→N has an infinite set S⊆N whose finite sums are thin for c, meaning there is i c(s)≠i all nonempty s finitely many distinct elements S. show computable instance thin-HT such solution computes ∅′, as case HT, shown Blass, Hirst, and Simpson (1987). In analyzing this proof, deduce implies ACA0 over RCA0+IΣ20. On other hand, using Rumyantsev Shen’s version Lovász Local Lemma, restriction exactly 2 any diagonally noncomputable degree relative ∅′. Hence no Σ20 solution.
منابع مشابه
Symmetric Versions of Laman's Theorem
Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are ‘fixed’ by various symmetry operations of the framework. For the group C3 which describes 3-fold rotational symmetry in the plane, we verify the conjecture proposed in [4] that these restrictions ...
متن کاملThe Thin Set Theorem for Pairs Implies DNR
Answering a question in the reverse mathematics of combinatorial principles, we prove that the Thin Set Theorem for Pairs (TS(2)) implies the Diagonally NonComputable Set Principle (DNR) over the base axiom system RCA0. 1. BACKGROUND AND DEFINITIONS The reverse mathematics of combinatorial principles has generated a good amount of interest in recent years. In particular, a lot of principles hav...
متن کاملFUZZY QUASI-METRIC VERSIONS OF A THEOREM OF GREGORI AND SAPENA
We provide fuzzy quasi-metric versions of a fixed point theorem ofGregori and Sapena for fuzzy contractive mappings in G-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.
متن کاملPolynomial-Time Versions of Sylow's Theorem
Let G be a subgroup of S,, given in terms of a generating set of permutations, and let p be a prime divisor of 1 G 1. If G is solvable-and, more generally, if the nonabelian composition factors of G are suitably restricted-it is shown that the following can be found in polynomial time: a Sylow p-subgroup of G containing a given p-subgroup, and an element of G conjugating a given Sylow p-subgrou...
متن کاملComputable Versions of Baire's Category Theorem
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead to different computational interpretations. We demonstrate that, analogously to the classical theorem, one of the computable versions of the theorem can be used to construct interesting counterexamples, such as a computab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2022
ISSN: ['0029-4527', '1939-0726']
DOI: https://doi.org/10.1215/00294527-2022-0027