English
Related papers

Related papers: Multi-Dimensional Interpretations of Presburger Ar…

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

B\"uchi arithmetics BA_n, n >= 2, are extensions of Presburger arithmetic with an unary functional symbol V_n(x) denoting the largest power of n that divides x. Definability of a set in BA_n is equivalent to its recognizability by a finite…

Logic · Mathematics 2022-11-30 Alexnader Zapryagaev

In this paper, we extend the investigation of four-dimensional partially alternative algebras $\mathcal A$ initiated in \cite{HNT}. The partial alternativity condition, a natural generalization of the alternativity axiom, broadens the class…

Rings and Algebras · Mathematics 2025-07-08 Tianran Hua , Marina Tvalavadze

We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose three well-known logics extending Presburger with reals. Our…

Logic in Computer Science · Computer Science 2008-12-11 Florent Bouchy , Alain Finkel , Jérôme Leroux

The Hausdorff dimension of the set of points that are covered infinitely many times by a sequence of randomly distributed balls in the unit cube can be expressed in terms of the sizes of the balls. This note presents a new proof of the…

Classical Analysis and ODEs · Mathematics 2019-10-29 Fredrik Ekström

We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…

Logic · Mathematics 2013-06-07 Tarek Sayed Ahmed

This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…

Logic · Mathematics 2025-11-05 Toby Meadows

For monomial special multiserial algebras, which in general are of wild representation type, we construct radical embeddings into algebras of finite representation type. As a consequence, we show that the representation dimension of…

Representation Theory · Mathematics 2017-11-10 Sibylle Schroll

We prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable…

Logic · Mathematics 2007-05-23 Raf Cluckers

We consider an expansion of Presburger arithmetic which allows multiplication by $k$ parameters $t_1,\ldots,t_k$. A formula in this language defines a parametric set $S_\mathbf{t} \subseteq \mathbb{Z}^{d}$ as $\mathbf{t}$ varies in…

Logic · Mathematics 2018-02-06 Tristram Bogart , John Goodrick , Danny Nguyen , Kevin Woods

We investigate expansions of Presburger arithmetic, i.e., the theory of the integers with addition and order, with additional structure related to exponentiation: either a function that takes a number to the power of $2$, or a predicate for…

Logic in Computer Science · Computer Science 2026-05-25 Michael Benedikt , Dmitry Chistikov , Alessio Mansutti

This paper is devoted to understand groups definable in Presburger arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded group…

Logic · Mathematics 2018-11-13 Alf Onshuus , Mariana Vicaría

We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order…

Logic in Computer Science · Computer Science 2024-08-14 Philipp Hieronymi , Dun Ma , Reed Oei , Luke Schaeffer , Christian Schulz , Jeffrey Shallit

We show that the extension of Presburger arithmetic by a quadratic generalised polynomial of a specific form is undecidable.

Number Theory · Mathematics 2025-10-08 Jakub Konieczny

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

Logic in Computer Science · Computer Science 2024-04-05 Michael Benedikt , Egor V. Kostylev , Tony Tan

We prove that insertion-elimination Lie algebra of Feynman graphs, in the ladder case, has a natural interpretation in terms of a certain algebra of infinite dimensional matrices. We study some aspects of its representation theory and we…

Quantum Algebra · Mathematics 2009-11-10 Igor Mencattini , Dirk Kreimer

The paper is devoted to an approach to the notion of the complex dilatation based on the following observations. (1) A natural measure of the distortion of the conformal structure by a real linear automorphism of the complex plane is the…

Complex Variables · Mathematics 2023-10-31 Nikolai V. Ivanov

In this paper we study systems of autonomous algebraic ODEs in several differential indeterminates. We develop a notion of algebraic dimension of such systems by considering them as algebraic systems. Afterwards we apply differential…

Algebraic Geometry · Mathematics 2022-02-10 Jose Cano , Sebastian Falkensteiner , Daniel Robertz , Rafael Sendra

We introduce the Pythagorean dimension: a natural number (or infinity) for all representations of the Cuntz algebra and certain unitary representations of the Richard Thompson groups called Pythagorean. For each natural number d we…

Operator Algebras · Mathematics 2024-08-06 Arnaud Brothier , Dilshan Wijesena

In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees…

Logic · Mathematics 2015-01-06 Jeroen Van der Meeren , Michael Rathjen , Andreas Weiermann