English
Related papers

Related papers: Stationary sets and infinitary logic

200 papers

We show that Kelley-Morse set theory does not prove the class Fodor principle, the assertion that every regressive class function $F:S\to\text{Ord}$ defined on a stationary class $S$ is constant on a stationary subclass. Indeed, it is…

Logic · Mathematics 2021-07-12 Victoria Gitman , Joel David Hamkins , Asaf Karagila

We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…

Logic · Mathematics 2019-12-10 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

Let kappa be an uncountable regular cardinal. Call an equivalence relation on functions from kappa into 2 Sigma_1^1-definable over H(kappa) if there is a first order sentence F and a parameter R subseteq H(kappa) such that functions…

Logic · Mathematics 2007-05-23 Saharon Shelah , Pauli Väisänen

Let G be an arbitrary Abelian group and let A be a finite subset of G. A has small additive doubling if |A+A| < K|A| for some K>0. These sets were studied in papers of G.A. Freiman, Y. Bilu, I. Ruzsa, M.C.--Chang, B. Green and T.Tao. In the…

Number Theory · Mathematics 2007-05-23 I. D. Shkredov

We consider the two-cardinal Kurepa Hypothesis $\mathsf{KH}(\kappa,\lambda)$. We observe that if $\kappa\leq\lambda<\mu$ are infinite cardinals then…

Logic · Mathematics 2025-10-17 Fanxin Wu

Given a lattice $\mathbb{L}$ and a class $K$ of algebraic structures, we say that $\mathbb{L}$ \emph{forces nilpotency} in $K$ if every algebra $\mathbf{A} \in K$ whose congruence lattice $\mathrm{Con} (\mathbf{A})$ is isomorphic to…

Rings and Algebras · Mathematics 2020-11-30 Erhard Aichinger

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Classical Analysis and ODEs · Mathematics 2018-01-31 Zoltán Buczolich , Balázs Maga , Gáspár Vértesy

We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…

Logic in Computer Science · Computer Science 2012-05-07 Andreas Krebs , A. V. Sreejith

Let n be a positive integer and let Sigma_n be the symmetric group of degree n. Let S^lambda be the Specht module for Sigma_n corresponding to a partition lambda of n, defined over a field F of odd characteristic. We find the indecomposable…

Representation Theory · Mathematics 2007-05-23 Harald Ellers , John Murray

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

Combinatorics · Mathematics 2020-10-19 Marcelo Campos , Maurício Collares , Robert Morris , Natasha Morrison , Victor Souza

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…

Logic · Mathematics 2026-05-13 Tenyo Takahashi

We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…

Logic in Computer Science · Computer Science 2019-03-14 Steffen van Bakel , Franco Barbanera , Ugo de'Liguoro

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…

Formal Languages and Automata Theory · Computer Science 2023-05-01 Thomas Place , Marc Zeitoun

Let $A$ and $C$ be two unital simple C*-algebas with tracial rank zero. Suppose that $C$ is amenable and satisfies the Universal Coefficient Theorem. Denote by ${{KK}}_e(C,A)^{++}$ the set of those $\kappa$ for which…

Operator Algebras · Mathematics 2008-03-10 Huaxin Lin , Zhuang Niu

Let k be an algebraically closed field and A a finite dimensional associative k-algebra. We prove that there is no gap in the lengths of indecomposable A-modules of finite length. The analogous result holds for an abelian k-linear category…

Representation Theory · Mathematics 2012-01-12 Klaus Bongartz

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

We establish the splitting principle for differential K-theory, a refinement of topological K-theory that incorporates geometric data via differential forms. Using this principle, we prove that the differential $K^0$-ring associated to…

K-Theory and Homology · Mathematics 2026-02-04 Bo Liu , Xiaonan Ma

We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

Logic in Computer Science · Computer Science 2017-07-26 Ori Lahav , João Marcos , Yoni Zohar