English
Related papers

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

200 papers

The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium…

Logic in Computer Science · Computer Science 2015-08-21 Thomas Given-Wilson , Axel Legay

In this note we show that no extension of bi-intuitionistic logic, except for classical logic, is structurally complete; indeed, none of them are passively structurally complete. A direct proof of active structural completeness is given for…

Logic · Mathematics 2025-08-11 Rodrigo Nicolau Almeida , Nick Bezhanishvili

Regular episturmian words are episturmian words whose directive words have a regular and restricted form making them behave more like Sturmian words than general episturmian words. We present a method to evaluate the initial nonrepetitive…

Formal Languages and Automata Theory · Computer Science 2024-03-28 Jarkko Peltomäki

We show that there are $\Sigma_3^0$-complete languages of infinite words accepted by non-deterministic Petri nets with B\"uchi acceptance condition, or equivalently by B\"uchi blind counter automata. This shows that omega-languages accepted…

Logic in Computer Science · Computer Science 2014-01-28 Olivier Finkel , Michał Skrzypczak

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…

Logic in Computer Science · Computer Science 2017-01-11 Pascal Tesson , Denis Therien

We prove a result on the representation of squares by second degree polynomials in the field of $p$-adic meromorphic functions in order to solve positively B\"uchi's $n$ squares problem in this field (that is, the problem of the existence…

Complex Variables · Mathematics 2010-03-10 Hector Pasten

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

We study polynomial identities of algebras with involution of nonassociative algebras over a field of characteristic zero. We prove that the growth of the sequence of $*$-codimensions of a finite-dimensional algebra is exponentially…

Rings and Algebras · Mathematics 2022-10-20 Dušan D. Repovš , Mikhail V. Zaicev

We prove that a Schauder frame for any separable Banach space is shrinking if and only if it has an associated space with a shrinking basis, and that a Schauder frame for any separable Banach space is shrinking and boundedly complete if and…

Functional Analysis · Mathematics 2012-02-14 Kevin Beanland , Daniel Freeman , Rui Liu

We show that normality for continued fractions expansions and normality for base-$b$ expansions are maximally logically separate. In particular, the set of numbers that are normal with respect to the continued fraction expansion but not…

Number Theory · Mathematics 2021-11-24 Steve Jackson , Bill Mance , Joseph Vandehey

We study the decidability of termination for two CHR dialects which, similarly to the Datalog like languages, are defined by using a signature which does not allow function symbols (of arity >0). Both languages allow the use of the =…

Logic in Computer Science · Computer Science 2010-07-27 Maurizio Gabbrielli abd Jacopo Mauro , Maria Chiara Meo , Jon Sneyers

We consider dynamic versions of epistemic logic as formulated in Baltag and Moss "Logics for epistemic programs" (2004). That paper proposed a logical language (actually families of languages parameterized by action signatures) for dynamic…

Logic in Computer Science · Computer Science 2022-03-15 Alexandru Baltag , Lawrence S. Moss , Slawomir Solecki

We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…

Rings and Algebras · Mathematics 2017-01-09 Dušan D. Repovš , Mikhail V. Zaicev

The binomial notation (w u) represents the number of occurrences of the word u as a (scattered) subword in w. We first introduce and study possible uses of a geometrical interpretation of (w ab) and (w ba) when a and b are distinct letters.…

Discrete Mathematics · Computer Science 2025-10-09 Gwenaël Richomme

Let G be a finite group of complex n by n unitary matrices generated by reflections acting on C^n. Let R be the ring of invariant polynomials, and \chi be a multiplicative character of G. Let \Omega^\chi be the R-module of \chi-invariant…

Rings and Algebras · Mathematics 2007-05-23 Anne V. Shepler

The string repetitiveness measures $\chi$ (the size of a smallest suffixient set of a string) and $r$ (the number of runs in the Burrows--Wheeler Transform) are related. Recently, we have shown that the bound $\chi \leq 2r$, proved by…

Data Structures and Algorithms · Computer Science 2026-02-25 Vinicius Tikara Venturi Date , Leandro Miranda Zatesko

In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the…

Logic in Computer Science · Computer Science 2023-06-22 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

We present an elementary Functional Analytic proof of the roughness of Exponential Dichotomy of Ordinary Differential Equations (with exponential growth) on an arbitrary Banach Space.

Functional Analysis · Mathematics 2009-06-05 Osvaldo Mendez , Nada al Hanna

We show that it is possible to define a realizability interpretation for the $\Sigma_2$-fragment of classical Analysis using G\"odel's System T only. This supplements a previous result of Schwichtenberg regarding bar recursion at types 0…

Logic · Mathematics 2015-01-30 Danko Ilik

The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation…

Formal Languages and Automata Theory · Computer Science 2013-01-16 Jean-Marc Champarnaud , Jean-Philippe Dubernard , Hadrien Jeanne , Ludovic Mignot
‹ Prev 1 3 4 5 6 7 10 Next ›