Thin equivalence relations in scaled pointclasses

For ordinals α beginning a Σ₁ gap in $\mathrm{L}(\mathbb {R})$, where $\Sigma _{1}^{\mathrm{J}_{\alpha }(\mathbb {R})}$ is closed under number quantification, we give an inner model‐theoretic proof that every thin $\Sigma _{1}^{\mathrm{J}_{\alpha }(\mathbb {R})}$ equivalence relation is $\Delta _{1}^{\mathrm{J}_{\alpha }(\mathbb {R})}$ in a real parameter from the (optimal) hypothesis $\mathsf {AD}^{\mathrm{J}_{\alpha }(\mathbb {R})}$.     

On effective σ‐boundedness and σ‐compactness

We prove several dichotomy theorems which extend some known results on σ‐bounded and σ‐compact pointsets. In particular we show that, given a finite number of $\Delta ^{1}_{1}$ equivalence relations $\mathrel {\mathsf {F}}_1,\dots ,\mathrel {\mathsf {F}}_n$, any $\Sigma ^{1}_{1}$ set A of the Baire space either is covered by compact $\Delta ^{1}_{1}$ sets and lightface $\Delta ^{1}_{1}$ equivalence classes of the relations $\mathrel {\mathsf {F}}_i$, or A contains a superperfect subset which is pairwise $\mathrel {\mathsf {F}}_i$‐inequivalent for all i = 1, …, n. Further generalizations to $\Sigma ^{1}_{2}$ sets A are obtained.     

Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document}

This paper describes a new and user‐friendly method for constructing models of non‐well‐founded set theory. Given a sufficiently well‐behaved system θ of non‐well‐founded set‐theoretic equations, we describe how to construct a model M_θ for $\mathsf {ZFC}^-$ in which θ has a non‐degenerate solution. We shall prove that this M_θ is the smallest model for $\mathsf {ZFC}^-$ which contains $\mathbf {V}$ and has a non‐degenerate solution of θ.     

Do there exist complete sets for promise classes?

In this paper we investigate the following two questions:

相似文献   

Compact and Loeb Hausdorff spaces in \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathsf {ZF}$\end{document} and the axiom of choice for families of finite sets

Given a set X, $\mathsf {AC}^{\mathrm{fin}(X)}$ denotes the statement: “$[X]^{<\omega }\backslash \lbrace \varnothing \rbrace$ has a choice set” and $\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )$ denotes the family of all closed subsets of the topological space $\mathbf {2}^{X}$ whose definition depends on a finite subset of X. We study the interrelations between the statements $\mathsf {AC}^{\mathrm{fin}(X)},$ $\mathsf {AC}^{\mathrm{fin}([X]^{<\omega })},$ $\mathsf {AC}^{\mathrm{fin} (F_{n}(X,2))},$ $\mathsf {AC}^{\mathrm{fin}(\mathcal {\wp }(X))}$ and “$\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$has a choice set”. We show:

• (i) $\mathsf {AC}^{\mathrm{fin}(X)}$ iff $\mathsf {AC}^{\mathrm{fin}([X]^{<\omega } )}$ iff $\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$ has a choice set iff $\mathsf {AC}^{\mathrm{fin}(F_{n}(X,2))}$.
• (ii) $\mathsf {AC}_{\mathrm{fin}}$ ($\mathsf {AC}$ restricted to families of finite sets) iff for every set X, $\mathcal {C}_\mathrm{R}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$ has a choice set.
• (iii) $\mathsf {AC}_{\mathrm{fin}}$ does not imply “$\mathcal {K}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$ has a choice set($\mathcal {K}(\mathbf {X})$ is the family of all closed subsets of the space $\mathbf {X}$)
• (iv) $\mathcal {K}(\mathbf {2}^{X})\backslash \lbrace \varnothing \rbrace$ implies $\mathsf {AC}^{\mathrm{fin}(\mathcal {\wp }(X))}$ but $\mathsf {AC}^{\mathrm{fin}(X)}$ does not imply $\mathsf {AC}^{\mathrm{fin}(\mathcal {\wp }(X))}$.

We also show that “For every setX, “$\mathcal {K}\big (\mathbf {2}^{X}\big )\backslash \lbrace \varnothing \rbrace$has a choice set” iff “for every setX, $\mathcal {K}\big (\mathbf {[0,1]}^{X}\big )\backslash \lbrace \varnothing \rbrace$has a choice set” iff “for every product$\mathbf {X}$of finite discrete spaces,$\mathcal {K}(\mathbf {X})\backslash \lbrace \varnothing \rbrace$ has a choice set”.     

Imaginaries in Boolean algebras

Given an infinite Boolean algebra B, we find a natural class of $\varnothing$‐definable equivalence relations $\mathcal {E}_{B}$ such that every imaginary element from B^eq is interdefinable with an element from a sort determined by some equivalence relation from $\mathcal {E}_{B}$. It follows that B together with the family of sorts determined by $\mathcal {E}_{B}$ admits elimination of imaginaries in a suitable multisorted language. The paper generalizes author's earlier results concerning definable equivalence relations and weak elimination of imaginaries for Boolean algebras, obtained in 10 .     

Around splitting and reaping for partitions of ω

We investigate splitting number and reaping number for the structure (ω) ^ω of infinite partitions of ω. We prove that \mathfrakr_d ￡ non(M),non(N),\mathfrakd{\mathfrak{r}_{d}\leq\mathsf{non}(\mathcal{M}),\mathsf{non}(\mathcal{N}),\mathfrak{d}} and \mathfraks_d 3 \mathfrakb{\mathfrak{s}_{d}\geq\mathfrak{b}} . We also show the consistency results ${\mathfrak{r}_{d} > \mathfrak{b}, \mathfrak{s}_{d} < \mathfrak{d}, \mathfrak{s}_{d} < \mathfrak{r}, \mathfrak{r}_{d} < \mathsf{add}(\mathcal{M})}${\mathfrak{r}_{d} > \mathfrak{b}, \mathfrak{s}_{d} < \mathfrak{d}, \mathfrak{s}_{d} < \mathfrak{r}, \mathfrak{r}_{d} < \mathsf{add}(\mathcal{M})} and ${\mathfrak{s}_{d} > \mathsf{cof}(\mathcal{M})}${\mathfrak{s}_{d} > \mathsf{cof}(\mathcal{M})} . To prove the consistency \mathfrakr_d < add(M){\mathfrak{r}_{d} < \mathsf{add}(\mathcal{M})} and \mathfraks_d < cof(M){\mathfrak{s}_{d} < \mathsf{cof}(\mathcal{M})} we introduce new cardinal invariants \mathfrakr_pair{\mathfrak{r}_{pair}} and \mathfraks_pair{\mathfrak{s}_{pair}} . We also study the relation between \mathfrakr_pair, \mathfraks_pair{\mathfrak{r}_{pair}, \mathfrak{s}_{pair}} and other cardinal invariants. We show that cov(M),cov(N) ￡ \mathfrakr_pair ￡ \mathfraks_d,\mathfrakr{\mathsf{cov}(\mathcal{M}),\mathsf{cov}(\mathcal{N})\leq\mathfrak{r}_{pair}\leq\mathfrak{s}_{d},\mathfrak{r}} and \mathfraks ￡ \mathfraks_pair ￡ non(M),non(N){\mathfrak{s}\leq\mathfrak{s}_{pair}\leq\mathsf{non}(\mathcal{M}),\mathsf{non}(\mathcal{N})} .     

Linear extensions of partial orders and reverse mathematics

We introduce the notion of τ‐like partial order, where τ is one of the linear order types ω, ω*, ω + ω*, and ζ. For example, being ω‐like means that every element has finitely many predecessors, while being ζ‐like means that every interval is finite. We consider statements of the form “any τ‐like partial order has a τ‐like linear extension” and “any τ‐like partial order is embeddable into τ” (when τ is ζ this result appears to be new). Working in the framework of reverse mathematics, we show that these statements are equivalent either to $\mathsf {B}{\Sigma }^{0}_{2}$ or to $\mathsf {ACA}_0$ over the usual base system $\mathsf {RCA}_0$.     

Ranked structures and arithmetic transfinite recursion

is the natural subsystem of second-order arithmetic in which one can develop a decent theory of ordinals. We investigate classes of structures which are in a sense the ``well-founded part" of a larger, simpler class, for example, superatomic Boolean algebras (within the class of all Boolean algebras). The other classes we study are: well-founded trees, reduced Abelian -groups, and countable, compact topological spaces. Using computable reductions between these classes, we show that Arithmetic Transfinite Recursion is the natural system for working with them: natural statements (such as comparability of structures in the class) are equivalent to . The reductions themselves are also objects of interest.

     

Special Quasigraded Lie Algebras and Integrable Hamiltonian Systems

We construct a family of special quasigraded Lie algebras of functions of one complex variables with values in finite-dimensional Lie algebra , labeled by the special 2-cocycles F on . The main property of the constructed Lie algebras is that they admit Kostant-Adler-Symes scheme. Using them we obtain new integrable finite-dimensional Hamiltonian systems and new hierarchies of soliton equations.     

The axiom of real Blackwell determinacy

The theory of infinite games with slightly imperfect information has been developed for games with finitely and countably many moves. In this paper, we shift the discussion to games with uncountably many possible moves, introducing the axiom of real Blackwell determinacy ${\mathsf{Bl-AD}_\mathbb{R}}$ (as an analogue of the axiom of real determinacy ${\mathsf{AD}_\mathbb{R}}$ ). We prove that the consistency strength of ${\mathsf{Bl-AD}_\mathbb{R}}$ is strictly greater than that of AD.     

Categorical Structures Enriched in a Quantaloid: Orders and Ideals over a Base Quantaloid

Applying (enriched) categorical structures we define the notion of ordered sheaf on a quantaloid , which we call ‘ -order’. This requires a theory of semicategories enriched in the quantaloid , that admit a suitable Cauchy completion. There is a quantaloid of -orders and ideal relations, and a locally ordered category of -orders and monotone maps; actually, . In particular is , with Ω a locale, the category of ordered objects in the topos of sheaves on Ω. In general -orders can equivalently be described as Cauchy complete categories enriched in the split-idempotent completion of . Applied to a locale Ω this generalizes and unifies previous treatments of (ordered) sheaves on Ω in terms of Ω-enriched structures.Mathematics Subject Classifications (2000) 06F07, 18B35, 18D05, 18D20.     

Superatomic Boolean algebras constructed from strongly unbounded functions

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ^{++ +} ≤ λ, κ^<κ = κ and 2^κ = κ⁺, and η is an ordinal with κ⁺ ≤ η < κ⁺⁺ and cf(η) = κ⁺. Then, in some cardinal‐preserving generic extension there is a superatomic Boolean algebra $\mathcal BUsing Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ^{++ +} ≤ λ, κ^<κ = κ and 2^κ = κ⁺, and η is an ordinal with κ⁺ ≤ η < κ⁺⁺ and cf(η) = κ⁺. Then, in some cardinal‐preserving generic extension there is a superatomic Boolean algebra $\mathcal B$ such that $\mathrm{ht}(\mathcal B) = \eta + 1$, $\mathrm{wd}_{\alpha }(\mathcal B) = \kappa$ for every α < η and $\mathrm{wd}_{\eta }(\mathcal B) = \lambda$(i.e., there is a locally compact scattered space with cardinal sequence 〈κ〉_η^??〈λ〉). Especially, $\langle {\omega }\rangle _{{\omega }_1}{}^{\smallfrown } \langle {\omega }_3\rangle$ and $\langle {\omega }_1\rangle _{{\omega }_2}{}^{\smallfrown } \langle {\omega }_4\rangle$ can be cardinal sequences of superatomic Boolean algebras.     

-summand vectors in Banach spaces

The aim of this paper is to study the set of all -summand vectors of a real Banach space . We provide a characterization of -summand vectors in smooth real Banach spaces and a general decomposition theorem which shows that every real Banach space can be decomposed as an -sum of a Hilbert space and a Banach space without nontrivial -summand vectors. As a consequence, we generalize some results and we obtain intrinsic characterizations of real Hilbert spaces.

     

Equivariance and extendibility in finite reductive groups with connected center

We show that several character correspondences for finite reductive groups $G$ are equivariant with respect to group automorphisms under the additional assumption that the linear algebraic group associated to $G$ has connected center. The correspondences we consider are the so-called Jordan decomposition of characters introduced by Lusztig and the generalized Harish-Chandra theory of unipotent characters due to Broué–Malle–Michel. In addition we consider a correspondence giving character extensions, due to the second author, in order to verify the inductive McKay condition from Isaacs–Malle–Navarro for the non-abelian finite simple groups of Lie types $^3\mathsf{D }_4,\mathsf{E }_8,\mathsf{F }_4,^2\mathsf{F }_4$ , and $\mathsf{G }_2$ .     

Sequence encoding without induction

We show that the universally axiomatized, induction‐free theory $\mathsf {PA}^-$ is a sequential theory in the sense of Pudlák's 5 , in contrast to the closely related Robinson's arithmetic.     

A variant of Mathias forcing that preserves {\mathsf{ACA}_0}

We present and analyze ${F_\sigma}$ -Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as ${\mathsf{ACA}_0}$ and ${\mathsf{WKL}_0 + \mathsf{I}\Sigma^0_2}$ , whereas Mathias forcing does not. We also show that the needed reals for ${F_\sigma}$ -Mathias forcing (in the sense of Blass in Ann Pure Appl Logic 109(1–2):77–88, 2001) are just the computable reals, as opposed to the hyperarithmetic reals for Mathias forcing.     

Rice and Rice‐Shapiro Theorems for transfinite correction grammars

Hay and, then, Johnson extended the classic Rice and Rice‐Shapiro Theorems for computably enumerable sets, to analogs for all the higher levels in the finite Ershov Hierarchy. The present paper extends their work (with some motivations presented) to analogs in the transfinite Ershov Hierarchy. Some of the transfinite cases are done for all transfinite notations in Kleene's important system of notations, $\mathcal {O}$. Other cases are done for all transfinite notations in a very natural, proper subsystem $\mathcal {O}_{\mathrm{Cantor}}$ of $\mathcal {O}$, where $\mathcal {O}_{\mathrm{Cantor}}$ has at least one notation for each constructive ordinal. In these latter cases it is open as to what happens for the entire set of transfinite notations in $(\mathcal {O} -\mathcal {O}_{\mathrm{Cantor}})$.