中文
相关论文

相关论文: Characterizing the existence of a Borel complete e…

200 篇论文

We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences…

逻辑 · 数学 2016-11-16 Douglas Ulrich , Richard Rast , Michael C. Laskowski

We introduce a new invariant of Borel reducibility, namely the notion of thickness; this associates to every sentence $\Phi$ of $\mathcal{L}_{\omega_1 \omega}$ and to every cardinal $\lambda$, the thickness $\tau(\Phi, \lambda)$ of $\Phi$…

逻辑 · 数学 2024-07-16 Danielle Ulrich

Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a $\Pi_\alpha$ sentence, then there…

逻辑 · 数学 2026-02-23 Matthew Harrison-Trainor , J. Thomas Kim

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 consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

逻辑 · 数学 2024-07-16 Michael C. Laskowski , Danielle S. Ulrich

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

逻辑 · 数学 2026-05-07 David Gonzalez , Julia Knight

We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…

逻辑 · 数学 2025-05-02 David Gonzalez , Matthew Harrison-Trainor

A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.

逻辑 · 数学 2017-11-29 Paul B. Larson , Saharon Shelah

A variation of the Scott analysis of countable structures is applied to actions of non-Archimedean TSI Polish groups acting continuously on a Polish spaces. We give results on the potential Borel complexity spectrum of such groups, and…

逻辑 · 数学 2023-04-05 Shaun Allison

We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $\Sigma$ 0 $\xi$ (or $\Pi$ 0 $\xi$). We characterize…

逻辑 · 数学 2018-05-30 Dominique Lecomte

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

逻辑 · 数学 2026-03-30 Su Gao , André Nies , Gianluca Paolini

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

经典分析与常微分方程 · 数学 2024-09-30 Gergő Nemes

We prove a strong conceptual completeness theorem (in the sense of Makkai) for the infinitary logic $\mathcal L_{\omega_1\omega}$: every countable $\mathcal L_{\omega_1\omega}$-theory can be canonically recovered from its standard Borel…

逻辑 · 数学 2019-08-06 Ruiyuan Chen

We develop an analogue of the classical Scott analysis for metric structures and infinitary continuous logic. Among our results are the existence of Scott sentences for metric structures and a version of the Lopez-Escobar theorem. We also…

逻辑 · 数学 2017-08-03 Itai Ben Yaacov , Michal Doucha , Andre Nies , Todor Tsankov

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

逻辑 · 数学 2025-05-13 Michael Wolman

We investigate and compare $\mathcal F$-Borel classes and absolute $\mathcal F$-Borel classes. We provide precise examples distinguishing these two hierarchies. We also show that for separable metrizable spaces, $\mathcal F$-Borel classes…

一般拓扑 · 数学 2018-04-24 Vojtěch Kovařík

This is part I of a study on cardinals that are characterizable by Scott sentences. Building on [3], [6] and [1] we study which cardinals are characterizable by a Scott sentence $\phi$, in the sense that $\phi$ characterizes $\kappa$, if…

逻辑 · 数学 2016-02-10 Ioannis Souldatos

We observe that Hall's free projective extension $P \mapsto F(P)$ of partial planes is a Borel map, and use a modification of the construction introduced in [9] to conclude that the class of countable non-Desarguesian projective planes is…

逻辑 · 数学 2018-11-16 Gianluca Paolini

The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence…

计算机科学中的逻辑 · 计算机科学 2024-02-14 Manuel Bodirsky , Jakub Rydval , André Schrottenloher

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

逻辑 · 数学 2024-07-22 Iian B. Smythe
‹ 上一页 1 2 3 10 下一页 ›