中文
相关论文

相关论文: On unsuperstable theories in GDST

200 篇论文

We answer one of the main questions in generalized descriptive set theory, the Friedman-Hyttinen-Kulikov conjecture on the Borel reducibility of the Main Gap. We show a correlation between Shelah's Main Gap and generalized Borel…

逻辑 · 数学 2024-10-02 Miguel Moreno

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

逻辑 · 数学 2025-12-25 Manuel Bodirsky , Bertalan Bodor , Paolo Marimon

We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…

逻辑 · 数学 2013-03-15 Lynn Scow

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

逻辑 · 数学 2023-10-31 Miloš S. Kurilić

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…

逻辑 · 数学 2015-10-19 Richard Rast , Davender Singh Sahota

We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…

逻辑 · 数学 2013-06-28 Luca Motto Ros

We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…

逻辑 · 数学 2025-11-18 Ehud Hrushovski , Krzysztof Krupiński , Anand Pillay

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

逻辑 · 数学 2008-02-03 Saharon Shelah

Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…

逻辑 · 数学 2021-05-27 Predrag Tanović , Slavko Moconja , Dejan Ilić

This work can be thought as a contribution to the model theory of group extensions. We study the groups G which are interpretable in the disjoint union of two structures (seen as a two-sorted structure). We show that if one of the two…

逻辑 · 数学 2013-04-05 Alessandro Berarducci , Marcello Mamino

It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is a Borel complete equivalence…

逻辑 · 数学 2025-12-18 Jialiang He , Lili Shen , Yi Zhou

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 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

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…

逻辑 · 数学 2020-09-21 Amador Martin-Pizarro , Martin Ziegler

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…

We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing math.LO/0406440. If |A|+|T|<= mu, I subseteq C, |I| >=beth_{|T|^+}(mu) then some J subseteq I of cardinality mu^+ is an…

逻辑 · 数学 2009-02-15 Saharon Shelah

Saturation is (mu,kappa)-transferable in T if and only if there is an expansion T_1 of T with |T_1| = |T| such that if M is a mu-saturated model of T_1 and |M| \geq kappa then the reduct M|L(T) is kappa-saturated. We characterize theories…

逻辑 · 数学 2008-02-03 J. Baldwin , R. Grossberg , Saharon Shelah

In this paper we study the Borel reducibility of Borel equivalence relations, including some orbit equivalence relations, on the generalised Baire space $\kappa^\kappa$ for an uncountable $\kappa$ with the property…

逻辑 · 数学 2014-08-20 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

It is shown that the power set of $\kappa$ ordered by the subset relation modulo various versions of the non-stationary deal can be embedded into the partial order of Borel equivalence relations on $2^\kappa$ under Borel reducibility. Here…

逻辑 · 数学 2025-11-25 Vadim Kulikov

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

逻辑 · 数学 2016-09-07 Carsten Butz , Ieke Moerdijk