Embedding orders into the cardinals with $DC_{κ}$

Asaf Karagila

Displaying similar documents to “Embedding orders into the cardinals with $D C_{κ}$ ”

Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos (2013)

Fundamenta Mathematicae

Similarity:

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence $ϕ_{ℳ}$ if $ϕ_{ℳ}$ has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if $ℵ_{β}$ is characterized by a Scott sentence, then $2^{ℵ_{β + β ₁}}$ is (homogeneously) characterized by a Scott sentence, for all 0 <...

On ordinals accessible by infinitary languages

Saharon Shelah, Pauli Väisänen, Jouko Väänänen (2005)

Fundamenta Mathematicae

Similarity:

Let λ be an infinite cardinal number. The ordinal number δ(λ) is the least ordinal γ such that if ϕ is any sentence of $L_{λ ⁺ ω}$ , with a unary predicate D and a binary predicate ≺, and ϕ has a model ℳ with $⟨ D^{ℳ}, ≺^{ℳ} ⟩$ a well-ordering of type ≥ γ, then ϕ has a model ℳ ’ where $⟨ D^{ℳ^{'}}, ≺^{ℳ^{'}} ⟩$ is non-well-ordered. One of the interesting properties of this number is that the Hanf number of $L_{λ ⁺ ω}$ is exactly $ℶ_{δ (λ)}$ . It was proved in [BK71] that if ℵ₀ < λ < κ $a r e r e g u l a r c a r d i n a l n u m b e r s, t h e n t h e r e i s a f o r c i n g e x t e n s i o n, p r e s e r v i n g c o f i n a l i t i e s, s u c h t h a t i n t h e e x t e n s i o n$ 2λ = κ $a n d δ (λ) < λ ⁺ ⁺ . W e i m p r o v e t h i s r e s u l t b y p r o v i n g t h e f o l l o w i n g : S u p p o s e ℵ ₀ < λ < θ \leq κ a r e c a r d i n a l n u m b e r s s u c h t h a t$ ∙ $λ^{< λ} = λ$ ; ∙ cf(θ) ≥ λ⁺ and $μ^{λ} < θ$ whenever μ < θ; ∙ $κ^{λ} = κ$ . Then there...

Locally Σ₁-definable well-orders of H(κ⁺)

Peter Holy, Philipp Lücke (2014)

Fundamenta Mathematicae

Similarity:

Given an uncountable cardinal κ with $κ = κ^{< κ}$ and $2^{κ}$ regular, we show that there is a forcing that preserves cofinalities less than or equal to $2^{κ}$ and forces the existence of a well-order of H(κ⁺) that is definable over ⟨H(κ⁺),∈⟩ by a Σ₁-formula with parameters. This shows that, in contrast to the case "κ = ω", the existence of a locally definable well-order of H(κ⁺) of low complexity is consistent with failures of the GCH at κ. We also show that the forcing mentioned above introduces a Bernstein...

Uncountable cardinals have the same monadic ∀₁¹ positive theory over large sets

Athanassios Tzouvaras (2004)

Fundamenta Mathematicae

Similarity:

We show that uncountable cardinals are indistinguishable by sentences of the monadic second-order language of order of the form (∀X)ϕ(X) and (∃X)ϕ(X), for ϕ positive in X and containing no set-quantifiers, when the set variables range over large (= cofinal) subsets of the cardinals. This strengthens the result of Doner-Mostowski-Tarski [3] that (κ,∈), (λ,∈) are elementarily equivalent when κ, λ are uncountable. It follows that we can consistently postulate that the structures $(2^{κ}, {[2^{κ}]}^{> κ}, <)$ , $(2^{λ}, {[2^{λ}]}^{> λ}, <)$ are...

Constructibility in Ackermann's set theory

C. Alkor

Similarity:

CONTENTSIntroduction......................... 5Section I. Preliminaries............ 6 § 1. Notation..................... 6 § 2. Ackermann’s set theory and some extensions................. 7 § 3. Absoluteness............................................... 8 § 4. Ordinals................................................... 9 § 5. Reflection principles...................................... 10Section 2. The usual notion of constructibility.............. 11 § 1. General considerations about...

Counting models of set theory

Ali Enayat (2002)

Fundamenta Mathematicae

Similarity:

Let T denote a completion of ZF. We are interested in the number μ(T) of isomorphism types of countable well-founded models of T. Given any countable order type τ, we are also interested in the number μ(T,τ) of isomorphism types of countable models of T whose ordinals have order type τ. We prove: (1) Suppose ZFC has an uncountable well-founded model and $κ \in ω \cup ℵ ₀, ℵ ₁, 2^{ℵ ₀}$ . There is some completion T of ZF such that μ(T) = κ. (2) If α <ω₁ and μ(T,α) > ℵ₀, then $μ (T, α) = 2^{ℵ ₀}$ . (3) If α < ω₁ and T ⊢ V ≠ OD,...

Reflecting character and pseudocharacter

Lucia R. Junqueira, Alberto M. E. Levi (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We say that a cardinal function $φ$ reflects an infinite cardinal $κ$ , if given a topological space $X$ with $φ (X) \geq κ$ , there exists $Y \in {[X]}^{\leq κ}$ with $φ (Y) \geq κ$ . We investigate some problems, discussed by Hodel and Vaughan in Reflection theorems for cardinal functions, Topology Appl. 100 (2000), 47–66, and Juhász in Cardinal functions and reflection, Topology Atlas Preprint no. 445, 2000, related to the reflection for the cardinal functions character and pseudocharacter. Among other results, we present some new equivalences...

Coloring ordinals by reals

Jörg Brendle, Sakaé Fuchino (2007)

Fundamenta Mathematicae

Similarity:

We study combinatorial principles we call the Homogeneity Principle HP(κ) and the Injectivity Principle IP(κ,λ) for regular κ > ℵ₁ and λ ≤ κ which are formulated in terms of coloring the ordinals < κ by reals. These principles are strengthenings of $C^{s} (κ)$ and $F^{s} (κ)$ of I. Juhász, L. Soukup and Z. Szentmiklóssy. Generalizing their results, we show e.g. that IP(ℵ₂,ℵ₁) (hence also IP(ℵ₂,ℵ₂) as well as HP(ℵ₂)) holds in a generic extension of a model of CH by Cohen forcing, and IP(ℵ₂,ℵ₂) (hence...

Internally club and approachable for larger structures

John Krueger (2008)

Fundamenta Mathematicae

Similarity:

We generalize the notion of a fat subset of a regular cardinal κ to a fat subset of $P_{κ} (X)$ , where κ ⊆ X. Suppose μ < κ, $μ^{< μ} = μ$ , and κ is supercompact. Then there is a generic extension in which κ = μ⁺⁺, and for all regular λ ≥ μ⁺⁺, there are stationarily many N in ${[H (λ)]}^{μ ⁺}$ which are internally club but not internally approachable.

L-like Combinatorial Principles and Level by Level Equivalence

Arthur W. Apter (2009)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We force and construct a model in which GCH and level by level equivalence between strong compactness and supercompactness hold, along with certain additional “L-like” combinatorial principles. In particular, this model satisfies the following properties: (1) $♢_{δ}$ holds for every successor and Mahlo cardinal δ. (2) There is a stationary subset S of the least supercompact cardinal κ₀ such that for every δ ∈ S, $◻_{δ}$ holds and δ carries a gap 1 morass. (3) A weak version of $◻_{δ}$ holds for every...

Definable orthogonality classes in accessible categories are small

Joan Bagaria, Carles Casacuberta, A. R. D. Mathias, Jiří Rosický (2015)

Journal of the European Mathematical Society

Similarity:

We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopěnka’s principle. We prove that the necessary large-cardinal hypotheses depend on the complexity of the formulas defining the given classes, in the sense of the Lévy hierarchy. For example, the statement that, for a class $𝒮$ of morphisms in a locally presentable category $𝒞$ of structures, the orthogonal class of objects...

Preservation of properties of a map by forcing

Akira Iwasa (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let $f : X \to Y$ be a continuous map such as an open map, a closed map or a quotient map. We study under what circumstances $f$ remains an open, closed or quotient map in forcing extensions.

Iterating along a Prikry sequence

Spencer Unger (2016)

Fundamenta Mathematicae

Similarity:

We introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from large cardinals that it is consistent that the tree property holds at ℵₙ for n ≥ 2, $ℵ_{ω}$ is strong limit and $2^{ℵ_{ω}} = ℵ_{ω + 2}$ .

On certain non-constructive properties of infinite-dimensional vector spaces

Eleftherios Tachtsis (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In set theory without the axiom of choice ( $AC$ ), we study certain non-constructive properties of infinite-dimensional vector spaces. Among several results, we establish the following: (i) None of the principles AC $^{LO}$ (AC for linearly ordered families of nonempty sets)—and hence AC $^{WO}$ (AC for well-ordered families of nonempty sets)— $DC (< κ)$ (where $κ$ is an uncountable regular cardinal), and “for every infinite set $X$ , there is a bijection $f : X \to {0, 1} \times X$ ”, implies the statement “there exists a field $F$ such that...

A partition property of cardinal numbers

N. H. Williams

Similarity:

CONTENTSIntroduction....................................................................................... 5§ 1. Notation and definitions......................................................... 5§ 2. Negative relations.................................................................... 9§ 3. The Ramification Lemma ..................................................... 10§ 4. The main theorem................................................................... 13§ 5. A result for cardinals...

Level by level equivalence and the number of normal measures over $P_{κ} (λ)$

Arthur W. Apter (2007)

Fundamenta Mathematicae

Similarity:

We construct two models for the level by level equivalence between strong compactness and supercompactness in which if κ is λ supercompact and λ ≥ κ is regular, we are able to determine exactly the number of normal measures $P_{κ} (λ)$ carries. In the first of these models, $P_{κ} (λ)$ carries $2^{2^{{[λ]}^{< κ}}}$ many normal measures, the maximal number. In the second of these models, $P_{κ} (λ)$ carries $2^{2^{{[λ]}^{< κ}}}$ many normal measures, except if κ is a measurable cardinal which is not a limit of measurable cardinals. In this case, κ (and...

Cardinal sequences of length < ω₂ under GCH

István Juhász, Lajos Soukup, William Weiss (2006)

Fundamenta Mathematicae

Similarity:

Let (α) denote the class of all cardinal sequences of length α associated with compact scattered spaces (or equivalently, superatomic Boolean algebras). Also put $_{λ} (α) = s \in (α) : s (0) = λ = m i n [s (β) : β < α]$ . We show that f ∈ (α) iff for some natural number n there are infinite cardinals $λ ₀ i > λ ₁ > . . . > λ_{n - 1}$ and ordinals $α ₀, . . ., α_{n - 1}$ such that $α = α ₀ + \dots + α_{n - 1}$ and $f = f ₀ ⏜ f ₁ ⏜ . . . ⏜ f_{n - 1}$ where each $f_{i} \in_{λ_{i}} (α_{i})$ . Under GCH we prove that if α < ω₂ then (i) $_{ω} (α) = s \in^{α} ω, ω ₁ : s (0) = ω$ ; (ii) if λ > cf(λ) = ω, $_{λ} (α) = s \in^{α} λ, λ ⁺ : s (0) = λ, s^{- 1} λ i s ω ₁ - c l o s e d i n α$ ; (iii) if cf(λ) = ω₁, $_{λ} (α) = s \in^{α} λ, λ ⁺ : s (0) = λ, s^{- 1} λ i s ω - c l o s e d a n d s u c c e s s o r - c l o s e d i n α$ ; (iv) if cf(λ) > ω₁, $_{λ} (α) =^{α} λ$ . This yields a complete characterization of the classes (α) for all...

On the bounding, splitting, and distributivity numbers

Alan S. Dow, Saharon Shelah (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The cardinal invariants $𝔥, 𝔟, 𝔰$ of $𝒫 (ω)$ are known to satisfy that $ω_{1} \leq 𝔥 \leq min {𝔟, 𝔰}$ . We prove that all inequalities can be strict. We also introduce a new upper bound for $𝔥$ and show that it can be less than $𝔰$ . The key method is to utilize finite support matrix iterations of ccc posets following paper Ultrafilters with small generating sets by A. Blass and S. Shelah (1989).

The tree property at both $ℵ_{ω + 1}$ and $ℵ_{ω + 2}$

Laura Fontanella, Sy David Friedman (2015)

Fundamenta Mathematicae

Similarity:

We force from large cardinals a model of ZFC in which $ℵ_{ω + 1}$ and $ℵ_{ω + 2}$ both have the tree property. We also prove that if we strengthen the large cardinal assumptions, then in the final model $ℵ_{ω + 2}$ even satisfies the super tree property.

On sentences provable in impredicative extensions of theories

Zygmunt Ratajczyk

Similarity:

CONTENTS0. Introduction.......................................................................... 51. Preliminaries............................................................................... 72. Basic facts to be used in the sequel....................................... 113. Predicates OD(.,.) and CL(.,.).................................................... 174. Predicate Sels............................................................................. 185. Strong $\sum_{n}^{1}$ -collection...........................................................

On the solvability of systems of linear equations over the ring $ℤ$ of integers

Horst Herrlich, Eleftherios Tachtsis (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We investigate the question whether a system ${(E_{i})}_{i \in I}$ of homogeneous linear equations over $ℤ$ is non-trivially solvable in $ℤ$ provided that each subsystem ${(E_{j})}_{j \in J}$ with $| J | \leq c$ is non-trivially solvable in $ℤ$ where $c$ is a fixed cardinal number such that $c < | I |$ . Among other results, we establish the following. (a) The answer is ‘No’ in the finite case (i.e., $I$ being finite). (b) The answer is ‘No’ in the denumerable case (i.e., $| I | = ℵ_{0}$ and $c$ a natural number). (c) The answer in case that $I$ is uncountable and $c \leq ℵ_{0}$ is ‘No...

Generic extensions of models of ZFC

Lev Bukovský (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The paper contains a self-contained alternative proof of my Theorem in Characterization of generic extensions of models of set theory, Fund. Math. 83 (1973), 35–46, saying that for models $M \subseteq N$ of ZFC with same ordinals, the condition $A p r_{M, N} (κ)$ implies that $N$ is a $κ$ -C.C. generic extension of $M$ .

On the Set-Theoretic Strength of Countable Compactness of the Tychonoff Product $2^{ℝ}$

Eleftherios Tachtsis (2010)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We work in ZF set theory (i.e., Zermelo-Fraenkel set theory minus the Axiom of Choice AC) and show the following: 1. The Axiom of Choice for well-ordered families of non-empty sets ( $A C^{W O}$ ) does not imply “the Tychonoff product $2^{ℝ}$ , where 2 is the discrete space 0,1, is countably compact” in ZF. This answers in the negative the following question from Keremedis, Felouzis, and Tachtsis [Bull. Polish Acad. Sci. Math. 55 (2007)]: Does the Countable Axiom of Choice for families of non-empty sets...

Displaying similar documents to “Embedding orders into the cardinals with D C κ ”

Displaying similar documents to “Embedding orders into the cardinals with $D C_{κ}$ ”