Related papers: Axiomatization of B\"uchi arithmetic
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
Following the classical approach of Birkhoff, we suggest an enriched version of enriched universal algebra. Given a suitable base of enrichment $\mathcal V$, we define a language $\mathbb L$ to be a collection of $(X,Y)$-ary function…
Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive…
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
We introduce a weight assignment logic for reasoning about quantitative languages of infinite words. This logic is an extension of the classical MSO logic and permits to describe quantitative properties of systems with multiple weight…
In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our…
We study and describe possibilities for arities of elementary theories and of their expansions. Links for arities with respect to Boolean algebras, to disjoint unions and to compositions of structures are shown. The dynamics for arities of…
We prove Abelian and Tauberian theorems for regularised Cauchy transforms of positive Borel measures on the real line whose distribution functions grow at most polynomially at infinity. In particular, we relate the asymptotics of the…
We review the philosophical framework of mathematical conceptualism as an alternative to set-theoretic foundations and show how mainstream mathematics can be developed on this basis. The paper includes an explicit axiomatization of the…
In number theory, we know Legendre's formula $ v_p(n!) = \sum_{k \ge 1} \lfloor \frac{n}{p^k} \rfloor $, which calculates the $p$-adic valuation of the factorial, i.e. the exponent of the greatest power of a prime $p$ that divides $n!$.…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
We survey the classical results of the Dirichlet Approximation Theorem.
In this work, we present multiple new optimizations and heuristics for the determinization of B\"uchi automata that exploit a number of semantic and structural properties, most of which may be applied together with any determinization…
We introduce two approximate variants of inclusion dependencies and examine the axiomatization and computational complexity of their implication problems. The approximate variants allow for some imperfection in the database and differ in…
In this didactic note, we describe a procedure to derive successive approximations of $\pi$ using Euler Beta functions. It is an interesting exercise for undergraduate students, since it involves polynomial roots, integral calculations,…
The aim of this paper is to review how some approximation results in commutative algebra are being used to construct equisingular deformations of singularities. The first example of such an approximation result appeared for the first time…
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic…
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment…
Roughly speaking, Buckingham's $\Pi$-Theorem provides a method to "guess" the structure of physical formulas simply by studying the dimensions (the physical units) of the involved quantities. Here we will prove a quantitative version of…
For $p\geq 2$, the $p$-adic ring $C^*$-algebra $\mathcal{Q}_p$ is the universal $C^*$-algebra generated by a unitary $U$ and an isometry $S_p$ such that $S_pU=U^pS_p$ and $\sum_{l=0}^{p-1}U^lS_pS_p^*U^{-l}=1$. For any $k$ coprime with $p$…