English
Related papers

Related papers: Expansions of the ordered additive group of real n…

200 papers

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 show that the amended monadic Grzegorczyk logic $\mathsf{M^+Grz}$ is the largest modal companion of the amended monadic intuitionistic logic $\mathsf{M^+IPC}$. Thus, unlike the monadic intuitionistic logic $\mathsf{MIPC}$, Esakia's…

Logic · Mathematics 2025-12-23 Guram Bezhanishvili , Luca Carai

The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…

Number Theory · Mathematics 2022-06-10 F. Javier de Vega

If the space $\mathcal{Q}$ of quadratic forms in $\mathbb{R}^n$ is splitted in a direct sum $\mathcal{Q}_1\oplus...\oplus \mathcal{Q}_k$ and if $X$ and $Y$ are independent random variables of $\mathbb{R}^n$, assume that there exist a real…

Statistics Theory · Mathematics 2016-08-14 Gerard Letac , Jacek Wesołowski

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…

Combinatorics · Mathematics 2015-10-14 Vitaly Bergelson , Joel Moreira

We study expansions of the Weak Monadic Second Order theory of (N,<) by cardinality relations, which are predicates R(X1,...,Xn) whose truth value depends only on the cardinality of the sets X1, ...,Xn. We first provide a (definable)…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bès

We consider first-order definability and decidability questions over rings of integers of algebraic extensions of $\Q$, paying attention to the uniformity of definitions. The uniformity follows from the simplicity of our first-order…

Number Theory · Mathematics 2024-06-05 Barry Mazur , Karl Rubin , Alexandra Shlapentokh

A proof of Lagrange's and Jacobi's four-square theorem due to Hurwitz utilizes orders in a quaternion algebra over the rationals. Seeking a generalization of this technique to orders over number fields, we identify two key components: an…

Number Theory · Mathematics 2025-09-25 Matěj Doležálek

In this paper we establish properties of independence for the continued fraction expansions of two algebraic numbers. Roughly speaking, if the continued fraction expansions of two irrational algebraic numbers have the same long sub-word,…

Number Theory · Mathematics 2017-02-10 Xianzu Lin

It is shown that each pseudonorm defined on a subgroup $H$ of an abelian group $G$ can be extended to a pseudonorm on $G$ such that the densities of the obtained pseudometrizable topological groups coincide. We derive from this that any…

General Topology · Mathematics 2008-10-20 T. Banakh , L. Zdomskyy

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

Combinatorics · Mathematics 2016-02-24 Kevin Henriot

Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…

Group Theory · Mathematics 2008-03-11 Nir Avni

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

Logic in Computer Science · Computer Science 2026-05-19 Piotr Bacik , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , Madhavan Venkatesh , Emil Rugaard Wieser

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

General Mathematics · Mathematics 2021-10-14 Dagnachew Jenber

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

Number Theory · Mathematics 2011-08-02 Mitja Lakner , Peter Petek , Marjeta Škapin Rugelj

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

Logic in Computer Science · Computer Science 2016-02-22 Kaustuv Chaudhuri

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…

Group Theory · Mathematics 2012-03-15 Henry Cohn , Christopher Umans

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Logic · Mathematics 2023-07-06 Christopher J. Eagle , Clovis Hamel , Sandra Müller , Franklin D. Tall

This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results…

Logic in Computer Science · Computer Science 2023-06-22 Anupam Das , Colin Riba