Related papers: Axiomatization of B\"uchi arithmetic
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
A characterization of multiplicative (and additive) arithmetical functions is given. Using this characterization, we show that the group of multiplicative arithmetical functions is isomorphic to the group of additive arithmetical functions.
Abelian complexity of a word $\mathbf{u}$ is a function that counts the number of pairwise non-abelian-equivalent factors of $\mathbf{u}$ of length $n$. We prove that for any $c$-balanced Parry word $\mathbf{u}$, the values of the abelian…
The topic of diversity is an interesting subject, both as a purely mathematical concept and also for its applications to important real-life situations. Unfortunately, although the meaning of diversity seems intuitively clear, no precise…
We extend a p-adic spectral theorem of M. M. Vishik to a certain class of p-adic Banach algebras. This class includes inductive limits of finite-dimensional p-adic Banach algebras of the form B(X), where X is a finite-dimensional p-adic…
It is stated that Boolean set algebras with unit V, where V is a union of Cartesian products, are axiomatizable. The axiomatization coincides with that of cylindric polyadic equality algebras (class CPE). This is an algebraic representation…
Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be…
One of the outstanding problems of philosophy of science and mathematics today is whether there is just "one" unique mathematics or the same can be bifurcated into "pure" and "applied" categories. A novel solution for this problem is…
In this paper, we give an axiomatization of the ordinal number system, in the style of Dedekind's axiomatization of the natural number system. The latter is based on a structure $(N,0,s)$ consisting of a set $N$, a distinguished element…
Following ideas of Geck and Rouquier, we show that there exists a ``canonical basic set'' of Specht modules in bijection with the simple modules of Ariki-Koike algebras at roots of unity. Moreover, we determine the parametrization of this…
Probabilistic B\"uchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined. In this…
We prove that every abstract elementary class (a.e.c.) with LST number $\kappa$ and vocabulary $\tau$ of cardinality $\leq \kappa$ can be axiomatized in the logic ${\mathbb L}_{\beth_2(\kappa)^{+++},\kappa^+}(\tau)$. In this logic an a.e.c.…
We give an explicit algebraic description, based on prismatic cohomology, of the algebraic K-groups of rings of the form $O_K/I$ where $K$ is a p-adic field and $I$ is a non-trivial ideal in the ring of integers $O_K$; this class includes…
The main goal of this research is to model and investigate generalizations of functions from [31]. Arguments of modeled functions are presented by the representation $\pi_{\mathfrak p}$ from [22].
We establish arithmetical properties and provide essential bounds for bi-sequences of approximation coefficients associated with the natural extension of maps, leading to continued fraction-like expansions. These maps are realized as the…
In the present paper, we consider Presburger arithmetic PrA and the theory of real closed fields RCF. Due to quantifier elimination in these theories, there are two kinds of natural ways to axiomatize them. Namely, on one hand, PrA can be…
In this work we present some arithmetic properties of families of abelian $p$--extensions of global function fields, among which are their generators and their type of ramification and decomposition.
This paper describes a class of probabilistic approximation algorithms based on bucket elimination which offer adjustable levels of accuracy and efficiency. We analyze the approximation for several tasks: finding the most probable…
The arithmetic derivative is a function from the natural numbers to itself that sends all prime numbers to $1$ and satisfies the Leibniz rule. The arithmetic partial derivative with respect to a prime $p$ is the $p$-th component of the…
A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…