scholarly journals Comparisons of Polychromatic and Monochromatic Ramsey Theory

2013 ◽  
Vol 78 (3) ◽  
pp. 951-968 ◽  
Author(s):  
Justin Palumbo
Keyword(s):  
Classical Result ◽  
Ramsey Theory ◽  
Axiom Of Choice ◽  
Ramsey Theorem ◽  
Partition Relations ◽  
Combinatorial Principles ◽  
The Axiom Of Choice ◽  
Relationship Of ◽  
The Relationship ◽  
Special Classes

AbstractWe compare the strength of polychromatic and monochromatic Ramsey theory in several set-theoretic domains. We show that the rainbow Ramsey theorem does not follow from ZF, nor does the rainbow Ramsey theorem imply Ramsey's theorem over ZF. Extending the classical result of Erdős and Rado we show that the axiom of choice precludes the natural infinite exponent partition relations for polychromatic Ramsey theory. We introduce rainbow Ramsey ultrafilters, a polychromatic analogue of the usual Ramsey ultrafilters. We investigate the relationship of rainbow Ramsey ultrafilters with various special classes of ultrafilters, showing for example that every rainbow Ramsey ultrafilter is nowhere dense but rainbow Ramsey ultrafilters need not be rapid. This entails comparison of the polychromatic and monochromatic Ramsey theorems as combinatorial principles on ω.

Infinite subscripts from infinite exponents

1984 ◽  
Vol 49 (2) ◽  
pp. 558-562 ◽  
Author(s):  
James E. Baumgartner ◽  
James M. Henle
Keyword(s):  
Axiom Of Choice ◽  
Partition Relations ◽  
The Sixties ◽  
Infinite Case ◽  
The Axiom Of Choice ◽  
The Relationship

Definition. For ordinals α ≤ κ, = [X]α = {p ⊆ X ∣ ot (p) = α}. For α ≤, κ, κ a cardinal, holds iff for every partition F: [Κ]κ → A, there is an X ∈ [Κ]κ with F constant on [X]α. X is called homogeneous for F. When A = 2 the subscript is omitted.It has been known since the sixties that for finite exponents all such properties are equivalent, i.e., κ→ (κ)2 iff for all n < ω, β < κ. The infinite case is much more difficult, though it is not actually known to be different. The usual methods for dealing with partitions fail, and as the weakest of these properties violates the Axiom of Choice, many techniques are unavailable.It is extremely unlikely that an infinite exponent can be increased, but infinite subscripts are generally possible.Theorem. If ∥ α ∥ · 2 ≤ α, then κ → (κ)α implies for all λ < κ.In §1, we show the subscript can be any λ < κ. In §2 we extend this to 2λ. In §3 we discuss the possibilities with limited amounts of well-ordered choice, and apply the theorem to the problem of obliging ordinals. Except in §3, we assume no choice. For the story of finite exponents, see [1]. For the relationship between infinite-exponent partition relations and choice, see [4].

scholarly journals The relationship between two weak forms of the axiom of choice

1973 ◽  
Vol 80 (1) ◽  
pp. 75-79 ◽  
Author(s):  
Paul Howard ◽  
Herman Rubin ◽  
Jean Rubin
Keyword(s):  
Axiom Of Choice ◽  
The Axiom Of Choice ◽  
The Relationship

Model theory under the axiom of determinateness

1985 ◽  
Vol 50 (3) ◽  
pp. 773-780
Author(s):  
Mitchell Spector
Keyword(s):  
Model Theory ◽  
Axiom Of Choice ◽  
Order Logic ◽  
First Order Logic ◽  
Technical Innovation ◽  
First Order ◽  
Partition Relations ◽  
Hanf Number ◽  
The Axiom Of Choice

AbstractWe initiate the study of model theory in the absence of the Axiom of Choice, using the Axiom of Determinateness as a powerful substitute. We first show that, in this context, is no more powerful than first-order logic. The emphasis then turns to upward Löwenhein-Skolem theorems; ℵ1 is the Hanf number of first-order logic, of , and of a strong fragment of , The main technical innovation is the development of iterated ultrapowers using infinite supports; this requires an application of infinite-exponent partition relations. All our theorems can be proven from hypotheses weaker than AD.

scholarly journals Power Kripke–Platek set theory and the axiom of choice

2020 ◽  
Vol 30 (1) ◽  
pp. 447-457
Author(s):  
Michael Rathjen
Keyword(s):  
Set Theory ◽  
Axiom Of Choice ◽  
Selection Mechanism ◽  
Ordinal Analysis ◽  
Inner Model ◽  
Power Set ◽  
The Axiom Of Choice ◽  
The Relationship ◽  
Set Operation

Abstract While power Kripke–Platek set theory, ${\textbf{KP}}({\mathcal{P}})$, shares many properties with ordinary Kripke–Platek set theory, ${\textbf{KP}}$, in several ways it behaves quite differently from ${\textbf{KP}}$. This is perhaps most strikingly demonstrated by a result, due to Mathias, to the effect that adding the axiom of constructibility to ${\textbf{KP}}({\mathcal{P}})$ gives rise to a much stronger theory, whereas in the case of ${\textbf{KP}}$, the constructible hierarchy provides an inner model, so that ${\textbf{KP}}$ and ${\textbf{KP}}+V=L$ have the same strength. This paper will be concerned with the relationship between ${\textbf{KP}}({\mathcal{P}})$ and ${\textbf{KP}}({\mathcal{P}})$ plus the axiom of choice or even the global axiom of choice, $\textbf{AC}_{\tiny {global}}$. Since $L$ is the standard vehicle to furnish a model in which this axiom holds, the usual argument for demonstrating that the addition of ${\textbf{AC}}$ or $\textbf{AC}_{\tiny {global}}$ to ${\textbf{KP}}({\mathcal{P}})$ does not increase proof-theoretic strength does not apply in any obvious way. Among other tools, the paper uses techniques from ordinal analysis to show that ${\textbf{KP}}({\mathcal{P}})+\textbf{AC}_{\tiny {global}}$ has the same strength as ${\textbf{KP}}({\mathcal{P}})$, thereby answering a question of Mathias. Moreover, it is shown that ${\textbf{KP}}({\mathcal{P}})+\textbf{AC}_{\tiny {global}}$ is conservative over ${\textbf{KP}}({\mathcal{P}})$ for $\varPi ^1_4$ statements of analysis. The method of ordinal analysis for theories with power set was developed in an earlier paper. The technique allows one to compute witnessing information from infinitary proofs, providing bounds for the transfinite iterations of the power set operation that are provable in a theory. As the theory ${\textbf{KP}}({\mathcal{P}})+\textbf{AC}_{\tiny {global}}$ provides a very useful tool for defining models and realizability models of other theories that are hard to construct without access to a uniform selection mechanism, it is desirable to determine its exact proof-theoretic strength. This knowledge can for instance be used to determine the strength of Feferman’s operational set theory with power set operation as well as constructive Zermelo–Fraenkel set theory with the axiom of choice.

Adding a closed unbounded set

1976 ◽  
Vol 41 (2) ◽  
pp. 481-482 ◽  
Author(s):  
J. E. Baumgartner ◽  
L. A. Harrington ◽  
E. M. Kleinberg
Keyword(s):  
Regular Cardinal ◽  
Measurable Cardinal ◽  
Axiom Of Choice ◽  
Partition Relations ◽  
Uncountable Cardinal ◽  
Unbounded Subset ◽  
The Axiom Of Choice ◽  
Closed Unbounded Subset

The extreme interest of set theorists in the notion of “closed unbounded set” is epitomized in the following well-known theorem:Theorem A. For any regular cardinal κ > ω, the intersection of any two closed unbounded subsets of κ is closed and unbounded.The proof of this theorem is easy and in fact yields a stronger result, namely that for any uncountable regular cardinal κ the intersection of fewer than κ many closed unbounded sets is closed and unbounded. Thus, if, for κ a regular uncountable cardinal, we let denote {A ⊆ κ ∣ A contains a closed unbounded subset}, then, for any such κ, is a κ-additive nonprincipal filter on κ.Now what about the possibility of being an ultrafilterκ It is routine to see that this is impossible for κ > ℵ1. However, for κ = ℵ1 the situation is different. If were an ultrafilter, ℵ1 would be a measurable cardinal. As is well-known this is impossible if we assume the axiom of choice; however if ZF + “there exists a measurable cardinal” is consistent, then so is ZF + “ℵ1 is a measurable cardinal” [2]. Furthermore, under the assumption of certain set theoretic axioms (such as the axiom of determinateness or various infinite exponent partition relations) can be proven to be an ultrafilter. (See [3] and [5].)

A FINITE-TO-ONE MAP FROM THE PERMUTATIONS ON A SET

2016 ◽  
Vol 95 (2) ◽  
pp. 177-182 ◽  
Author(s):  
NATTAPON SONPANOW ◽  
PIMPEN VEJJAJIVA
Keyword(s):  
Set Theory ◽  
Axiom Of Choice ◽  
Symbolic Logic ◽  
The Axiom Of Choice ◽  
The Relationship ◽  
Infinite Set

Forster [‘Finite-to-one maps’, J. Symbolic Logic68 (2003), 1251–1253] showed, in Zermelo–Fraenkel set theory, that if there is a finite-to-one map from ${\mathcal{P}}(A)$, the set of all subsets of a set $A$, onto $A$, then $A$ must be finite. If we assume the axiom of choice (AC), the cardinalities of ${\mathcal{P}}(A)$ and the set $S(A)$ of permutations on $A$ are equal for any infinite set $A$. In the absence of AC, we cannot make any conclusion about the relationship between the two cardinalities for an arbitrary infinite set. In this paper, we give a condition that makes Forster’s theorem, with ${\mathcal{P}}(A)$ replaced by $S(A)$, provable without AC.

A measurable cardinal with a nonwellfounded ultrapower

1980 ◽  
Vol 45 (3) ◽  
pp. 623-628 ◽  
Author(s):  
Mitchell Spector
Keyword(s):  
Set Theory ◽  
Measurable Cardinal ◽  
Axiom Of Choice ◽  
Partial Ordering ◽  
Partition Relation ◽  
Partition Relations ◽  
Consistency Results ◽  
The Axiom Of Choice ◽  
Measurable Cardinals ◽  
Weakened Form

The usefulness of measurable cardinals in set theory arises in good part from the fact that an ultraproduct of wellfounded structures by a countably complete ultrafilter is wellfounded. In the standard proof of the wellfoundedness of such an ultraproduct, one first shows, without any use of the axiom of choice, that the ultraproduct contains no infinite descending chains. One then completes the proof by noting that, assuming the axiom of choice, any partial ordering with no infinite descending chain is wellfounded. In fact, the axiom of dependent choices (a weakened form of the axiom of choice) suffices. It is therefore of interest to ask whether some use of the axiom of choice is needed in order to prove the wellfoundedness of such ultraproducts or whether, on the other hand, their wellfoundedness can be proved in ZF alone. In Theorem 1, we show that the axiom of choice is needed for the proof (assuming the consistency of a strong partition relation). Theorem 1 also contains some related consistency results concerning infinite exponent partition relations. We then use Theorem 1 to show how to change the cofinality of a cardinal κ satisfying certain partition relations to any regular cardinal less than κ, while introducing no new bounded subsets of κ. This generalizes a theorem of Prikry [5].

Jonsson-like partition relations and j: V → V

2004 ◽  
Vol 69 (4) ◽  
pp. 1267-1281 ◽  
Author(s):  
Arthur W. Apter ◽  
Grigor Sargsyan
Keyword(s):  
Axiom Of Choice ◽  
Elementary Embedding ◽  
Partition Relation ◽  
Partition Relations ◽  
Final Segment ◽  
The Axiom Of Choice ◽  
Jonsson Cardinals

Abstract.Working in the theory ”ZF + There is a nontrivial elementary embedding j : V → V“, we show that a final segment of cardinals satisfies certain square bracket finite and infinite exponent partition relations. As a corollary to this, we show that this final segment is composed of Jonsson cardinals. We then show how to force and bring this situation down to small alephs. A prototypical result is the construction of a model for ZF in which every cardinal μ ≥ ℵ2 satisfies the square bracket infinite exponent partition relation . We conclude with a discussion of some consistency questions concerning different versions of the axiom asserting the existence of a nontrivial elementary embedding j: V → V. By virtue of Kunen's celebrated inconsistency result, we use only a restricted amount of the Axiom of Choice.

Partitions of products

1993 ◽  
Vol 58 (3) ◽  
pp. 860-871 ◽  
Author(s):  
Carlos A. Di Prisco ◽  
James M. Henle
Keyword(s):  
Finite Number ◽  
Axiom Of Choice ◽  
Inaccessible Cardinal ◽  
Partition Relation ◽  
Partition Relations ◽  
Image Position ◽  
The Axiom Of Choice ◽  
Usual Notation

We will consider some partition properties of the following type: given a function F: ωω →2, is there a sequence H0, H1, … of subsets of ω such that F is constant on ΠiεωHi? The answer is obviously positive if we allow all the Hi's to have exactly one element, but the problem is nontrivial if we require the Hi's to have at least two elements. The axiom of choice contradicts the statement “for all F: ωω→ 2 there is a sequence H0, H1, H2,… of subsets of ω such that {i|(Hi) ≥ 2} is infinite and F is constant on ΠHi”, but the infinite exponent partition relation ω(ω)ω implies it; so, this statement is relatively consistent with an inaccessible cardinal. (See [1] where these partition properties were considered.)We will also consider partitions into any finite number of pieces, and we will prove some facts about partitions into ω-many pieces.Given a partition F: ωω → k, we say that H0, H1…, a sequence of subsets of ω, is homogeneous for F if F is constant on ΠHi. We say the sequence H0, H1,… is nonoverlapping if, for all i ∈ ω, ∪Hi > ∩Hi+1.The sequence 〈Hi: i ∈ ω〉 is of type 〈α0, α1,…〉 if, for every i ∈ ω, ∣Hi∣ = αi.We will adopt the usual notation for polarized partition relations due to Erdös, Hajnal, and Rado.means that for every partition F: κ1 × κ2 × … × κn→δ there is a sequence H0, H1,…, Hn such that Hi ⊂ κi and ∣Hi∣ = αi for every i, 1 ≤ i ≤ n, and F is constant on H1 × H2 × … × Hn.

Ultrapowers without the axiom of choice

1988 ◽  
Vol 53 (4) ◽  
pp. 1208-1219 ◽  
Author(s):  
Mitchell Spector
Keyword(s):  
General Theory ◽  
Set Theory ◽  
Fundamental Theorem ◽  
Axiom Of Choice ◽  
Partition Relations ◽  
Omitting Types ◽  
The Axiom Of Choice ◽  
Almost All ◽  
Models Of Set Theory ◽  
Theory And Model

AbstractA new method is presented for constructing models of set theory, using a technique of forming pseudo-ultrapowers. In the presence of the axiom of choice, the traditional ultrapower construction has proven to be extremely powerful in set theory and model theory; if the axiom of choice is not assumed, the fundamental theorem of ultrapowers may fail, causing the ultrapower to lose almost all of its utility. The pseudo-ultrapower is designed so that the fundamental theorem holds even if choice fails; this is arranged by means of an application of the omitting types theorem. The general theory of pseudo-ultrapowers is developed. Following that, we study supercompactness in the absence of choice, and we analyze pseudo-ultrapowers of models of the axiom of determinateness and various infinite exponent partition relations. Relationships between pseudo-ultrapowers and forcing are also discussed.

Sign in / Sign up

Export Citation Format

Share Document