arXiv 1811.024722018-11-20math.LO

Morley's theorem and Vaught's conjecture via Algebraic logic

M. Assem, T. S. Ahmed, G. Sági, D. Sziráki

备注：: There is an error in the authors of the paper. G. Sagi and D. Sziráki are not co-authors

英文摘要：

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 cylindric and quasi-polyadic algebras. Also, as in Morley's proof, we use results from descriptive set theory. After all this, we show that our proof can be modified to talk about the number of models omitting a certain family of types. \end{abstract}

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Vaught's Two-Cardinal Theorem and Quasi-Minimality in Continuous Logic

We prove the following continuous analogue of Vaught's Two-Cardinal Theorem: if for some $κ>λ\geq \aleph_0$, a continuous theory $T$ has a model with density character $κ$ which has a definable subset of density character $λ$, then $T$ has a model with density character $\aleph_1$ which has a separable definable subset. We also show that if we assume that $T$ is $ω$-stable, then if $T$ has a model of density character $\aleph_1$ with a separable definable set, then for any uncountable $κ$ we can find a model of $T$ with density character $κ$ which has a separable definable subset. In order to …

2021-10-12math.LO

Logics of Finite Hankel Rank

We discuss the Feferman-Vaught Theorem in the setting of abstract model theory for finite structures. We look at sum-like and product-like binary operations on finite structures and their Hankel matrices. We show the connection between Hankel matrices and the Feferman-Vaught Theorem. The largest logic known to satisfy a Feferman-Vaught Theorem for product-like operations is CFOL, first order logic with modular counting quantifiers. For sum-like operations it is CMSOL, the corresponding monadic second order logic. We discuss whether there are maximal logics satisfying Feferman-Vaught Theorems f…

2015-12-08math.LO

Free algebras, amalgamation, and a theorem of Vaught for many valued logics

We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic logic does not belong to many valued logic. Generalizing results of Comer proved in the classical first order case; working out a sheaf duality on the Zarski topology defined on the prime spectrum of such algebras, we infer several definability theorems, and obtain a representation theorem for theories as continuous sections of Sheaves. We also prove an omitt…

2013-04-03math.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…

2013-04-03math.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中形式化验证。

2026-10-14math.LO

Reduced products of metric structures: a metric Feferman-Vaught theorem

We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum Hypothesis. We also prove the existence of two separable C*-algebras of the form $\bigoplus_i M_{k(i)}(\mathbb{C})$ such that the assertion that their coronas are isomorphic is independent from ZFC, which gives the first example of genuinely non-commutative coronas of separable C*-algebras with this property.

2016-04-05math.LOmath.OA

更多相关论文收起更多论文

A game comonadic account of Courcelle and Feferman-Vaught-Mostowski theorems

Game comonads, introduced by Abramsky, Dawar and Wang, and developed by Abramsky and Shah, give a categorical semantics for model comparison games. We present an axiomatic account of Feferman-Vaught-Mostowski (FVM) composition theorems within the game comonad framework, parameterized by the model comparison game. In a uniform way, we produce compositionality results for the logic in question, and its positive existential and counting quantifier variants. Secondly, we extend game comonads to the second order setting, specifically in the case of Monadic Second Order (MSO) logic. We then generali…

2022-05-11cs.LOmath.CTmath.LO

利用 quantale 值逻辑对 Continuous Logic 的刻画

A characterization of Continuous Logic by using quantale-valued logics

论文将 Continuous Logic 推广到 co-quantale 值距离，并在结构条件下证明 Tarski-Vaught 判据与 Łoś 定理，从而通过放松条件构造新逻辑。

2024-06-12math.LO

莫利关于可数模型个数定理的一个不可判定扩张

An undecidable extension of Morley's theorem on the number of countable models

本文证明莫利关于可数一阶理论可数模型个数的定理在二阶逻辑扩张下不可判定，并在多个集合论模型中计算σ-射影等价关系的等价类个数，方法涉及随机力迫、科恩力迫、伍丁基数与内模型理论。

2023-07-05math.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 …

2015-09-06math.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…

1993-04-01math.FAmath.LO

Preservation theorems for strong first-order logics

We prove preservation theorems for $\mathcal{L}_{ω_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of Łoś-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{ω_1, ω}$ preserved by substructures (resp. homomorphic images). The solution, in $ZFC$, only uses general features and can be extended to several variants of other strong first-order logic that do not satisfy the interpolation theorem; instead, the results on infinitary definability are used. This solves an open problem dating back to 1977. Another consequence of our approach …

2019-12-26math.CTmath.LO

Atom-canonicity in algebraic logic in connection to omitting types in modal fragments of L_{ω, ω}

Fix 2<n<ω. Let L_n denote first order logic restricted to the first n variables. CA_n denotes the class of cylindric algebras of dimension n and for m>n, Nr_n\CA_m(\subseteq CA_n) denotes the class of n-neat reducts of CA_m's. The existence of certain finite relation algebras and finite CA_n's lacking relativized complete representations is shown to imply that the omitting types theorem (OTT) fails for L_n with respect to clique guarded semantics (which is an equivalent formalism of its packed fragments), and for the multi-dimensional modal logic S5^n. Several such relation and cylindric algeb…

2016-08-10math.LO