Vaught's conjecture on analytic sets
英文摘要：
This paper obtains an algebraic characterization of the Polish groups that satisfy Vaught's conjecture on $\bfΣ^1_1$ sets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
The $ω$-Vaught's Conjecture
We introduce the $ω$-Vaught's conjecture, a strengthening of the infinitary Vaught's conjecture. We believe that if one were to prove the infinitary Vaught's conjecture in a structural way without using techniques from higher recursion theory, then the proof would probably be a proof of the $ω$-Vaught's conjecture. We show the existence of an equivalent condition to the $ω$-Vaught's conjecture and use this tool to show that all infinitary sentences whose models are linear orders satisfy the $ω$-Vaught's conjecture.
math.LO
One more recursive-theoretic characterization of the Topological Vaught Conjecture
We prove in ZF a recursive-theoretic characterization of the Topological Vaught Conjecture by revisiting the fact that orbits in Polish $G$-spaces are Borel sets.
math.LO
The number of models of a fixed Scott rank, for a counterexample to the analytic Vaught conjecture
We show that if $γ\in ω\cup \{\aleph_{0}\}$ and $\mathcal{A}$ is a counterexample to the analytic Vaught conjecture having exactly $γ$ many models of Scott rank $ω_{1}$, then there exists a club $C \subseteq ω_{1}$ such that $\mathcal{A}$ has exactly $γ$ many models of Scott rank $α$, for each $α\in C$.
math.LO
$\omega$-稳定理论的类型$\omega$-Vaught猜想
The Type $ω$-Vaught's Conjecture for $ω$-stable Theories
University of Wisconsin-Madison（威斯康星大学麦迪逊分校）
本文提出Vaught猜想的一个新变体，基于Martin猜想和$\omega$-Vaught猜想，针对$\omega$-稳定理论证明之，并将Scott句所需量词数从$\omega+\omega$改进为$\omega+5$（可数情形）和$\omega+6$（不可数情形）。
math.LO
关于离散有序结构理论的瓦夫特猜想
Vaught's conjecture for theories of discretely ordered structures
Mathematical Institute SANU（塞尔维亚科学与艺术院数学研究所）
本文证明了具有可定义无限离散线性序的可数完备一阶理论拥有连续无穷多个可数模型，并引发了关于该理论博雷尔完备性的讨论。
math.LO
A computability theoretic equivalent to Vaught's conjecture
We prove that, for every theory $T$ which is given by an ${\mathcal L}_{ω_1,ω}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^ω$ on a cone of Turing degrees, every $X$-hyperarithmetic model of $T$ has an $X$-computable copy. We also find a concrete description, relative to some oracle, of the Turing-degree spectra of all the models of a counterexample to Vaught's conjecture.
math.LO
更多相关论文收起更多论文
关于$L_{ω_1,ω}$的Vaught猜想的一个反例
A counterexample to Vaught's Conjecture for $L_{ω_1,ω}$
Harvard University（哈佛大学）；Massachusetts Institute of Technology（麻省理工学院）；University of Oxford（牛津大学）
该研究构造了$L_{ω_1,ω}$的一个句子，其可数模型数为$\aleph_1$且无完美非同构模型，反驳了Vaught猜想，相关证明已在Lean中形式化验证。
math.LO
某些偏序类的精确 Vaught 猜想
Sharp Vaught's Conjecture for Some Classes of Partial Orders
本文将 Rubin 关于线性序完全理论的精确版 Vaught 猜想推广至包含线性序且在有限积与不相交并下封闭的最小偏序类，以及有根树扩展和无限线性序不相交并的树理论。
math.LO
Vaught's Conjecture for Monomorphic Theories
A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory ${\mathcal T}$ having infinite models is monomorphic iff it has a countable monomorphic model and confirm the Vaught conjecture for monomorphic theories. More precisely, we prove that if ${\mathcal T}$ is a complete monomorphic theory having infinite models, then the number of its non-isomorphic countable models, $I({\mathcal T},ω)$, is either equal to $1$ or to ${…
math.LO
Morley's theorem and Vaught's conjecture via Algebraic logic
Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if $T$ has more than $\aleph_1$ pairwise non-isomorphic countably infinite models, then it has $2^{\aleph_0}$ such models.\\ In this paper, we re-prove Morley's result and prove the corresponding statement for languages without equality, and for theories which are not necessarily complete. Our proof uses algebraic logic, namely the representation theory of cyli…
math.LO
Vaught's Conjecture for Almost Chainable Theories
A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $φ$ (i.e., local automorphism, in Fra\"ıssé's terminology) of the linear order $\langle Y\setminus F, < \rangle$ the mapping ${\mathrm{id}} _F \cup φ$ is a partial automorphism of ${\mathbb Y}$. By a theorem of Fra\"ıssé, if $|L|<ω$, then ${\mathbb Y}$ is almost chainable iff the profile of ${\mathbb Y}$ is bounded; namely, iff there is a positive integer $m$ such that ${\mathbb Y}$ ha…
math.LO
A López-Escobar theorem for metric structures, and the topological Vaught conjecture
We show that a version of López-Escobar's theorem holds in the setting of logic for metric structures. More precisely, let $\mathbb{U}$ denote the Urysohn sphere and let $\mathrm{Mod}(\mathcal{L},\mathbb{U})$ be the space of metric $\mathcal{L}$-structures supported on $\mathbb{U}$. Then for any $\mathrm{Iso}(\mathbb{U})$-invariant Borel function $f\colon \mathrm{Mod}(\mathcal{L}, \mathbb{U})\rightarrow \lbrack 0,1]$, there exists a sentence $ϕ$ of $\mathcal{L}_{ω_{1}ω}$ such that for all $M\in \mathrm{Mod}(\mathcal{L},\mathbb{U})$ we have $f(M)=ϕ^{M}$. At the same time we introduce a variant …
math.LO
An instance of Vaught's conjecture using algebraic logic
Let ϕbe a first order formula and M be a countable model. ϕ^M denotes the set of all assignments that satisfy ϕin M. Let M, N be countable models. A formula ϕdistinguishes these models if |ϕ^M|\neq |ϕ^N|. We show that the number of distinguishable countable models for a complete countable first order theory, satisfies the Glimm Effross dichotomy, hence also Vaught's conjecture. The proof in the presence of equality is fairly easy, though we need infinite conjunctions to implement it and somewhat heavy theorems from descriptive set theory. However, the case without equality seems to be much mor…
math.LO
Vaught猜想极小反例中的ω₁-锚定标签：基于见证者的三分法与无条件平稳二分法
$ω_1$-anchored labels in minimal counterexamples to Vaught's conjecture: a per-witness trichotomy and an unconditional stationary dichotomy
University of Toronto Mississauga（多伦多大学密西沙加分校）
该研究针对Vaught猜想的极小反例φ，证明了基于见证者的三分法、坐标恒等式、种子定理及无条件平稳二分法，还得到节点饱和模型唯一性与同构不变量，未直接证明Vaught猜想。
math.LO
Scott processes
The Scott process of a relational structure $M$ is the sequence of sets of formulas given by the Scott analysis of $M$. We present axioms for the class of Scott processes of structures in a relational vocabulary $τ$, and use them to give a proof of an unpublished theorem of Leo Harrington from the 1970's, showing that a counterexample to Vaught's Conjecture has models of cofinally many Scott ranks below $ω_{2}$. Our approach also gives a theorem of Harnik and Makkai, showing that if there exists a counterexample to Vaught's Conjecture, then there is a counterexample whose uncountable models ha…
math.LO
Vaught猜想与允许有限字典分解的偏序理论
Vaught's Conjecture and Theories of Partial Order Admitting a Finite Lexicographic Decomposition
Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad（诺维萨德大学理学院数学与信息学系）
本文研究了偏序理论中的Vaught猜想，证明了某些理论满足VC和VC$^\sharp$的条件。
math.LO
Orbit cardinalities
This paper considers "definable cardinalities" arising from Polish group actions. The first part of the paper answers a question of Becker-Kechris by showing that under suitable determinacy assumptions in ZF+DC, every action by a Polish group on a metric space is either as complicated as the Vitali equivalence relation or no more complicated than the equality relation on bounded subsets of \aleph_1. The same argument shows that if hereditarily wellorderabel sets can be used as complete invariants, then elements in HC will do. The second half gives a new proof of Howard Becker's recent theorem …
math.LO
Borel actions of Polish groups
We show that a {\it Borel} action of a Polish group on a standard Borel space is Borel isomorphic to a {\it continuous} action of the group on a Polish space, and we apply this result to three aspects of the theory of Borel actions of Polish groups: universal actions, invariant probability measures, and the Topological Vaught Conjecture. We establish the existence of universal actions for any given Polish group, extending a result of Mackey and Varadarajan for the locally compact case. We prove an analog of Tarski's theorem on paradoxical decompositions by showing that the existence of an inva…
math.FAmath.LO
Vaught猜想对于有根树的乘积之和的成立
Vaught's Conjecture for Sums of Products of Rooted Trees
Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad（诺维萨德大学理学院数学与信息系）
该论文确认了Vaught猜想对于由有根树经有限直积和字典序和构成的偏序类成立，并证明了相关理论的可公理化性质。
math.LO
有根树的乘积之并的沃特猜想
Vaught's Conjecture for Unions of Products of Rooted Trees
Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad（诺维萨德大学理学院数学与信息学系）
研究有根树在有限直积和有限不交并下的闭包中偏序集的沃特猜想，给出了其理论中模型个数、初等等价、初等子模型、原子模型和可数饱和模型的结构刻画。
math.LO
解析延拓与Zilber的拟极小性猜想
Analytic continuation and Zilber's quasiminimality conjecture
本文提出证明复指数域Zilber拟极小性猜想的策略，基于o-minimal结构的解析延拓性质，适用于可数整函数集扩张复域的情况，并讨论了该领域无条件知识的有限程度。
math.LO
