English
Related papers

Related papers: On unsuperstable theories in GDST

200 papers

We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…

Logic · Mathematics 2019-08-20 Saharon Shelah , Alexander Usvyatsov

The space of Lascar strong types, on some sort and relative to a given first order theory T, is in general not a compact Hausdorff space. This paper has at least three aims. First to show that spaces of Lascar strong types and other related…

Logic · Mathematics 2012-04-17 Krzysztof Krupinski , Anand Pillay , Slawomir Solecki

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

Logic · Mathematics 2020-03-23 Matteo Viale

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

Logic · Mathematics 2026-02-24 Predrag Tanović

We prove that for every uncountable cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, the quasi-order of embeddability on the $\kappa$-space of $\kappa$-sized graphs Borel reduces to the embeddability on the $\kappa$-space of…

Logic · Mathematics 2019-01-03 Filippo Calderoni

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…

Logic in Computer Science · Computer Science 2019-03-14 Antti Kuusisto , Jeremy Meyers , Jonni Virtema

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Logic · Mathematics 2021-11-02 Juvenal Murwanashyaka

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…

Logic · Mathematics 2026-03-10 Sven Manthe

Let $G$ be a countable branch group of automorphisms of a spherically homogeneous rooted tree. Under some assumption on finitarity of $G$, we construct, for each sequence $\omega\in\{0,1\}^\Bbb N$, an irreducible unitary representation…

Dynamical Systems · Mathematics 2025-03-07 Alexandre I. Danilenko , Artem Dudko

We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a $\pmb\Pi_\omega^0$-complete set of models. In…

Logic · Mathematics 2025-03-17 Uri Andrews , David Gonzalez , Steffen Lempp , Dino Rossegger , Hongyu Zhu

We find lower bounds on the rank of a "real" vector bundle over an involutive space, such that "real" vector bundles of higher rank have a trivial summand and such that a stable isomorphism for such bundles implies ordinary isomorphism. We…

K-Theory and Homology · Mathematics 2025-06-25 Malkhaz Bakuradze , Ralf Meyer

This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…

Logic · Mathematics 2007-06-13 Radoslaw Hofman

In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…

Logic · Mathematics 2015-08-19 M. Malliaris , S. Shelah

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical…

Logic · Mathematics 2023-03-24 Mark Kamsma

This paper contributes to the set-theoretic side of understanding Keisler's order. We consider properties of ultrafilters which affect saturation of unstable theories: the lower cofinality $\lcf(\aleph_0, \de)$ of $\aleph_0$ modulo $\de$,…

Logic · Mathematics 2012-04-09 M. Malliaris , S. Shelah

We review some recent results concerning integrable quantum field theories in 1+1 space-time dimensions which contain unstable particles in their spectrum. Recalling first the main features of analytic scattering theories associated to…

High Energy Physics - Theory · Physics 2007-05-23 O. A. Castro-Alvaredo , A. Fring

Let G be a connected complex semi-simple group, B a Borel subgroup of G, and T a maximal torus in B. We construct a class of smooth T-stable subvarieties inside the flag variety G/B, each of which is an embedding of a product of projective…

Algebraic Geometry · Mathematics 2007-05-23 Christian Ohn

We calculate the real rank and stable rank of CCR algebras which either have only finite dimensional irreducible representations or have finite topological dimension. We show that either rank of A is determined in a good way by the ranks of…

Operator Algebras · Mathematics 2017-06-09 Lawrence G. Brown