English
Related papers

Related papers: Classification over a predicate -- the general cas…

200 papers

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

There is an axiomatic treatment of Morley rank in groups, due to Borovik and Poizat. These axioms form the basis of the algebraic treatment of groups of finite Morley rank which is common today. There are, however, ranked structures, i.e.…

Logic · Mathematics 2007-11-27 Jeffrey Burdges , Gregory Cherlin

We explore the integration of representations from a Lie algebra to its algebraic group in positive characteristic. An integrable module is stable under the twists by group elements. Our aim is to investigate cohomological obstructions for…

Representation Theory · Mathematics 2019-10-30 Dmitriy Rumynin , Matthew Westaway

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

We point out that any stable generalized complex structure on a sphere bundle over a closed surface of genus at least two must be of constant type.

Differential Geometry · Mathematics 2025-01-17 Rafael Torres

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

We investigate the relationship between the generalization of program completion defined in 1984 by Lloyd and Topor and the generalization of the stable model semantics introduced recently by Ferraris et al. The main theorem can be used to…

Logic in Computer Science · Computer Science 2013-01-09 Vladimir Lifschitz , Fangkai Yang

With a model of a geometric theory in an arbitrary topos, we associate a site obtained by endowing a category of generalized elements of the model with a Grothendieck topology, which we call the antecedent topology. Then we show that the…

Category Theory · Mathematics 2021-04-13 Olivia Caramello , Axel Osmond

This paper presents several independence results concerning the topos-valid and the intuitionistic (generalized) predicative theories of locales. In particular, certain consequences of the consistency of a general form of Troelstra's…

Logic · Mathematics 2010-06-10 Giovanni Curi

Using algebraic geometry methods, the third author proved that the group ring of a surjunctive group with coefficients in a field is always stably finite. In other words, every group satisfying Gottschalk's conjecture also satisfies…

Group Theory · Mathematics 2023-11-07 Tullio Ceccherini-Silberstein , Michel Coornaert , Xuan Kien Phung

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

Logic · Mathematics 2007-05-23 Peter Koepke , Martin Koerwien

We develop a general stability analysis for objective structures, which constitute a far reaching generalization of crystal lattice systems. We show that these particle systems, although in general neither periodic nor space filling, allow…

Analysis of PDEs · Mathematics 2025-03-12 Bernd Schmidt , Martin Steinbach

We define model category structures on the category of chain complexes over a Grothendieck abelian category depending on the choice of a generating family, and we study their behaviour with respect to tensor products and stabilization. This…

Category Theory · Mathematics 2007-12-21 Denis-Charles Cisinski , Frédéric Déglise

We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…

Logic · Mathematics 2023-05-30 Itay Kaplan , Nicholas Ramsey , Pierre Simon

We develop Descriptive Set Theory in Generalized Baire Spaces without assuming $\kappa^{<\kappa}=\kappa$. We point out that without this assumption the basic topological concepts of these spaces have to be slightly modified in order to…

Logic · Mathematics 2025-11-04 Tapani Hyttinen , Miguel Moreno , Jouko Väänänen

Extensively evaluating the capabilities of (large) language models is difficult. Rapid development of state-of-the-art models induce benchmark saturation, while creating more challenging datasets is labor-intensive. Inspired by the recent…

Computation and Language · Computer Science 2025-06-02 Alan Sun

We prove that any tame abstract elementary class categorical in a suitable cardinal has an eventually global good frame: a forking-like notion defined on all types of single elements. This gives the first known general construction of a…

Logic · Mathematics 2016-03-11 Sebastien Vasey

We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…

Logic · Mathematics 2013-12-13 Nik Weaver

We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…

Logic · Mathematics 2022-12-23 Taichi Uemura

We show that for any $n\geq 3$ the theory of open generalized $n$-gons is complete, decidable and strictly stable, yielding a new class of examples in the zoo of stable theories.

Logic · Mathematics 2023-10-03 Anna-Maria Ammer , Katrin Tent