English
Related papers

Related papers: On the Expressiveness of B\"uchi Arithmetic

200 papers

We study the repetition of patches in self-affine tilings in R^d. In particular, we study the existence and non-existence of arithmetic progressions. We first show that an arithmetic condition of the expansion map for a self-affine tiling…

Dynamical Systems · Mathematics 2021-07-01 Yasushi Nagai , Shigeki Akiyama , Jeong-Yup Lee

Shape types are a general concept of process types which work for many process calculi. We extend the previously published Poly* system of shape types to support name restriction. We evaluate the expressiveness of the extended system by…

Logic in Computer Science · Computer Science 2010-04-01 Jan Jakubuv , J. B. Wells

We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…

Logic in Computer Science · Computer Science 2023-06-22 Mikołaj Bojańczyk , Thomas Colcombet

In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the…

Logic in Computer Science · Computer Science 2015-07-01 Qiqi Yan

For a slice--regular quaternionic function $f,$ the classical exponential function $\exp f$ is not slice--regular in general. An alternative definition of exponential function, the $*$-exponential $\exp_*$, was given: if $f$ is a…

Complex Variables · Mathematics 2024-03-12 Graziano Gentili , Jasna Prezelj , Fabio Vlacci

We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and…

Combinatorics · Mathematics 2025-06-06 Eva Foster , Aleksi Saarela , Aleksi Vanhatalo

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages $L$ that assign to each word $w$ a real number $L(w)$. In the case of infinite words, the value of a run is…

Logic in Computer Science · Computer Science 2009-05-15 Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger

We study an extension of FO^2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, `the letter a appears between…

Logic in Computer Science · Computer Science 2016-03-18 Andreas Krebs , Kamal Lodaya , Paritosh Pandya , Howard Straubing

Let W be an associative PI-affine algebra over a field F of characteristic zero. Suppose W is G-graded where G is a finite group. Let exp(W) and exp(W_e) denote the codimension growth of W and of the identity component W_e, respectively. We…

Rings and Algebras · Mathematics 2009-11-21 Eli Aljadeff

Let $\alpha \in \mathbb{C}$ be an exponential period. We show that the real and imaginary part of $\alpha$ are up to signs volumes of sets definable in the o-minimal structure generated by $\mathbb{Q}$, the real exponential function and…

Number Theory · Mathematics 2025-03-31 Johan Commelin , Philipp Habegger , Annette Huber

In this paper syntactic objects---concept constructors called part restrictions which realize rational grading are considered in Description Logics (DLs). Being able to convey statements about a rational part of a set of successors, part…

Logic in Computer Science · Computer Science 2019-05-27 Mitko Yanchev

A central question in the theory of automata is which classes of automata can be minimized in polynomial time. We close the remaining gaps for deterministic and history-deterministic automata over infinite words by proving that…

Formal Languages and Automata Theory · Computer Science 2025-04-30 Bader Abu Radi , Rüdiger Ehlers

We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

In topological modal logic, it is well known that the Cantor derivative is more expressive than the topological closure, and the `elsewhere,' or `difference,' operator is more expressive than the `somewhere' operator. In 2014, Kudinov and…

Logic · Mathematics 2021-09-14 David Fernández-Duque

We prove that for a weight $w$, which has at least polynomial decay, there exists a complete and minimal system $\{e^{i\lambda_n t}\}_{n\in \mathbb{N}}$ of exponentials in weighted space $L^2(w)$ on $(-\pi,\pi)$, which is not hereditarily…

Complex Variables · Mathematics 2025-11-06 Andrei V. Semenov

B\"uchi arithmetics $\mathop{\mathbf{BA}}\nolimits_n$, $n\ge 2$, are extensions of Presburger arithmetic with an unary functional symbol $V_n(x)$ denoting the largest power of $n$ that divides $x$. A rank of a linear order is the minimal…

Logic · Mathematics 2023-10-25 Alexander Zapryagaev

A measure representation result for a functional modelling optimal design problems for plastic deformations, under linear growth conditions, is obtained. Departing from an energy with a bulk term depending on the deformation gradient and…

Analysis of PDEs · Mathematics 2025-01-03 Ana Cristina Barroso , Elvira Zappale

We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…

Number Theory · Mathematics 2021-08-19 Jesse Elliott

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Formal Languages and Automata Theory · Computer Science 2025-02-03 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Howard Straubing