English
Related papers

Related papers: Stationary sets and infinitary logic

200 papers

For $K$ an abstract elementary class with amalgamation and no maximal models, we show that categoricity in a high-enough cardinal implies structural properties such as the uniqueness of limit models and the existence of good frames. This…

Logic · Mathematics 2016-02-18 Monica M. VanDieren , Sebastien Vasey

When classes of structures are not first-order definable, we might still try to find a nice description. There are two common ways for doing this. One is to expand the language, leading to notions of pseudo-elementary classes, and the other…

Logic · Mathematics 2020-05-01 Will Boney , Barbara F. Csima , Nancy A. Day , Matthew Harrison-Trainor

Bounded stationary reflection at a cardinal $\lambda$ is the assertion that every stationary subset of $\lambda$ reflects but there is a stationary subset of $\lambda$ that does not reflect at arbitrarily high cofinalities. We produce a…

Logic · Mathematics 2015-05-14 Chris Lambie-Hanson

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2021-11-30 Thomas Ehrhard

We show that if $\mathcal{L}_1$ and $\mathcal{L}_2$ are linear transformations from $\mathbb{Z}^d$ to $\mathbb{Z}^d$ satisfying certain mild conditions, then, for any finite subset $A$ of $\mathbb{Z}^d$, $$|\mathcal{L}_1 A+\mathcal{L}_2…

Combinatorics · Mathematics 2024-11-21 David Conlon , Jeck Lim

We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a…

Logic · Mathematics 2016-09-07 Saharon Shelah , Lee Stanley

Fisher [Fis75] and Baur [Bau75] showed independently in the seventies that if $T$ is a complete first-order theory extending the theory of modules, then the class of models of $T$ with pure embeddings is stable. In [Maz4, 2.12], it is asked…

Logic · Mathematics 2021-07-12 Marcos Mazari-Armida

We prove undecidability and pinpoint the place in the arithmetical hierarchy for commutative action logic, that is, the equational theory of commutative residuated Kleene lattices (action lattices), and infinitary commutative action logic,…

Logic · Mathematics 2021-02-24 Stepan L. Kuznetsov

We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…

Logic · Mathematics 2025-10-17 Jeremy Beard , Marcos Mazari-Armida

Let $R$ be a discrete valuation domain with field of fractions $Q$ and maximal ideal generated by $\pi$. Let $\Lambda$ be an $R$-order such that $Q\Lambda$ is a separable $Q$-algebra. Maranda showed that there exists $k\in\mathbb{N}$ such…

Representation Theory · Mathematics 2024-12-23 Lorna Gregory

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

Logic · Mathematics 2024-11-14 Fornasiero Antongiulio , Terzo Giuseppina

We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…

Logic · Mathematics 2017-02-22 Will Boney

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

Let $\mathscr E$ be a Hilbert $\mathscr A$-module over a $C^*$-algebra $\mathscr A$. For each positive linear functional $\omega$ on $\mathscr A$, we consider the localization $\mathscr E_\omega$ of $\mathscr E$, which is the completion of…

Operator Algebras · Mathematics 2024-11-05 Rasoul Eskandari , Mohammad Sal Moslehian

We investigate in ZFC what can be the family of large enough cardinals mu in which an a.e.c. K is categorical or even just solvable. We show that for not few cardinals lambda<mu there is a superlimit model in K_lambda. Moreover, our main…

Logic · Mathematics 2008-08-25 Saharon Shelah

Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda…

Logic · Mathematics 2017-08-08 Saharon Shelah

Let $\mu < \kappa < \lambda$ be three infinite cardinals, the first two being regular. We show that if there is no inner model with large cardinals, $u (\kappa, \lambda)$ is regular, where $u (\kappa, \lambda)$ denotes the least size of a…

Logic · Mathematics 2023-08-30 Pierre Matet

Does the class of linear orders have (one of the variants of) the so called (lambda, kappa)-limit model? It is necessarily unique, and naturally assuming some instances of G.C.H. we get some positive, i.e. existence results. More generally,…

Logic · Mathematics 2017-08-08 Saharon Shelah

This note gives two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular, while the second is a negative consistency result which applies to the situation of lambda…

Logic · Mathematics 2009-09-25 Mirna Džamonja , Saharon Shelah

We use ``iterated square sequences'' to show: There is an L-definable partition n: L-singulars --> omega such that if M is an inner model without 0#: (a) For some n, M satisfies that {alpha | n(alpha)=n} is stationary. (b) For each n there…

Logic · Mathematics 2016-09-07 Sy D. Friedman
‹ Prev 1 3 4 5 6 7 10 Next ›