中文
相关论文

相关论文: Long Borel Hierarchies

200 篇论文

We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $\Sigma^1_2$ chains in the assumption that…

逻辑 · 数学 2018-08-16 Vladimir Kanovei

It is shown that Borel games of length $\omega^2$ are determined if, and only if, for every countable ordinal $\alpha$, there is a fine-structural, countably iterable extender model of Zermelo set theory with $\alpha$-many iterated…

逻辑 · 数学 2019-06-28 J. P. Aguilera

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

逻辑 · 数学 2016-02-01 William Chan

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

逻辑 · 数学 2008-07-08 Saharon Shelah

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

逻辑 · 数学 2016-04-01 Richard Rast

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

逻辑 · 数学 2018-08-16 Vladimir Kanovei , Vassily Lyubetsky

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

逻辑 · 数学 2014-11-26 Márton Elekes , Tamás Keleti

The following is true in the Solovay model. 1. If $\leq$ is a Borel partial quasi-order on a Borel set $D$ of the reals, $X$ is a ROD subset of $D$, and $\leq$ restricted to $X$ is linear, then $X$ is countably cofinal in the sense of…

逻辑 · 数学 2018-08-16 Vladimir Kanovei

The family omega1-Borel sets is the smallest family of subsets of the real line which contains the family of open sets and is closed under complementation and omega1 unions. We show: Theorem 1. MA+notCH implies this hierarchy has length…

逻辑 · 数学 2011-07-26 Arnold W. Miller

The following is true in the Solovay model. 1. If $\le$ is a Borel partial order on a set $D$ of the reals, and $X$ is a ROD subset of $D$ linearly ordered by $\le$, then the restriction of $\le$ onto $X$ is countably cofinal. 2. If in…

逻辑 · 数学 2018-08-16 Vladimir Kanovei

We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…

逻辑 · 数学 2021-09-14 Ur Ya'ar

Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…

逻辑 · 数学 2007-05-23 Uri Abraham , Saharon Shelah

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

计算机科学中的逻辑 · 计算机科学 2017-01-03 Minseong Kim

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

逻辑 · 数学 2013-05-14 Luca Motto Ros

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

逻辑 · 数学 2026-03-10 Sven Manthe

We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…

逻辑 · 数学 2024-11-08 Juan Pablo Aguilera , Thibaut Kouptchinsky

We prove that it is relatively consistent with $\mathrm{ZFC}$ that every strong measure zero subset of the real line is meager-additive while there are uncountable strong measure zero sets (i.e., Borel's conjecture fails). This answers a…

逻辑 · 数学 2021-04-08 Daniel Calderón

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

逻辑 · 数学 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

Answering one of the main questions of [FHK14, Chapter 7], we show that there is a tight connection between the depth of a classifiable shallow theory $T$ and the Borel rank of the isomorphism relation $\cong^\kappa_T$ on its models of size…

逻辑 · 数学 2020-04-07 Francesco Mangraviti , Luca Motto Ros

We prove that the countable product of lines contains a Borel linear subspace $L\ne\mathbb R^\omega$ that cannot be covered by countably many closed Haar-meager sets. This example is applied to studying the interplay between various classes…

泛函分析 · 数学 2022-01-11 Taras Banakh , Eliza Jabłońska
‹ 上一页 1 2 3 10 下一页 ›