Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos

Displaying similar documents to “Characterizing the powerset by a complete (Scott) sentence”

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...

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...

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...

Propositional extensions of $L_{ω} 1_{ω}$

Richard Gostanian, Karel Hrbacek

Similarity:

CONTENTS0. Preliminaries....................................................................... 71. Adding propositional connectives to $L_{ω} 1_{ω}$ ............... 82. The propositional part of $L_{ω} 1_{ω}$ (S)............................. 103. The operation S and the Boolean algebra $B_{S}$ ............... 114. General model-theoretic properties of $L_{ω} 1_{ω}$ (S)...... 175. Hanf number computations...................................................... 226. Negative results for $L_{ω} 1_{ω}$ (S)...........................................

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...

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...........................................................

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 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...

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...

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...

Decidability and definability results related to the elementary theory of ordinal multiplication

Alexis Bès (2002)

Fundamenta Mathematicae

Similarity:

The elementary theory of ⟨α;×⟩, where α is an ordinal and × denotes ordinal multiplication, is decidable if and only if $α < ω^{ω}$ . Moreover if $|_{r}$ and $|_{l}$ respectively denote the right- and left-hand divisibility relation, we show that Th $⟨ ω^{ω^{ξ}} {; |}_{r} ⟩$ and Th $⟨ ω^{ξ} {; |}_{l} ⟩$ are decidable for every ordinal ξ. Further related definability results are also presented.

On preimages of ultrafilters in ZF

Horst Herrlich, Paul Howard, Kyriakos Keremedis (2016)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We show that given infinite sets $X, Y$ and a function $f : X \to Y$ which is onto and $n$ -to-one for some $n \in ℕ$ , the preimage of any ultrafilter $ℱ$ of $Y$ under $f$ extends to an ultrafilter. We prove that the latter result is, in some sense, the best possible by constructing a permutation model $ℳ$ with a set of atoms $A$ and a finite-to-one onto function $f : A \to ω$ such that for each free ultrafilter of $ω$ its preimage under $f$ does not extend to an ultrafilter. In addition, we show that in $ℳ$ there exists an ultrafilter compact...

Another ⋄-like principle

Michael Hrušák (2001)

Fundamenta Mathematicae

Similarity:

A new ⋄-like principle $⋄_{}$ consistent with the negation of the Continuum Hypothesis is introduced and studied. It is shown that $\neg ⋄_{}$ is consistent with CH and that in many models of = ω₁ the principle $⋄_{}$ holds. As $⋄_{}$ implies that there is a MAD family of size ℵ₁ this provides a partial answer to a question of J. Roitman who asked whether = ω₁ implies = ω₁. It is proved that $⋄_{}$ holds in any model obtained by adding a single Laver real, answering a question of J. Brendle who asked whether = ω₁...

The $ℒ_{n}^{m}$ -propositional calculus

Carlos Gallardo, Alicia Ziliani (2015)

Mathematica Bohemica

Similarity:

T. Almada and J. Vaz de Carvalho (2001) stated the problem to investigate if these Łukasiewicz algebras are algebras of some logic system. In this article an affirmative answer is given and the $ℒ_{n}^{m}$ -propositional calculus, denoted by $ℓ_{n}^{m}$ , is introduced in terms of the binary connectives $\to$ (implication), $↠$ (standard implication), $\land$ (conjunction), $\lor$ (disjunction) and the unary ones $f$ (negation) and $D_{i}$ , $1 \leq i \leq n - 1$ (generalized Moisil operators). It is proved that $ℓ_{n}^{m}$ belongs to the class of standard systems...

Spaces with property $(D C (ω_{1}))$

Wei-Feng Xuan, Wei-Xue Shi (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We prove that if $X$ is a first countable space with property $(D C (ω_{1}))$ and with a $G_{δ}$ -diagonal then the cardinality of $X$ is at most $𝔠$ . We also show that if $X$ is a first countable, DCCC, normal space then the extent of $X$ is at most $𝔠$ .

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...

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.