Related papers: Axiomatization of B\"uchi arithmetic

To study arithmetic structures of natural numbers, we introduce a notion of entropy of arithmetic functions, called anqie entropy. This entropy possesses some crucial properties common to both Shannon's and Kolmogorov's entropies. We show…

We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…

We discuss a formal system of mathematics. We use it to construct the natural numbers.

This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…

This paper examines various methods and ideas for humanizing mathematics. The term 'humanizing mathematics' which includes elements of 'aesthetic mathematics' refers to approaches that emphasize the aesthetic, philosophical, and subjective…

A binarization of a bounded variable $x$ is a linear formulation with variables $x$ and additional binary variables $y_1,\dots, y_k$, so that integrality of $x$ is implied by the integrality of $y_1,\dots, y_k$. A binary extended…

We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…

We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…

We introduce a class of Banach algebras of generalized matrices and study the existence of approximate units, ideal structure, and derivations of them.

Work in progress concerning alternative formalizations of arithmetic.

We introduce a certain restriction of weighted automata over the rationals, called image-binary automata. We show that such automata accept the regular languages, can be exponentially more succinct than corresponding NFAs, and allow for…

We provide a self-contained formulation of the BPHZ theorem in the Euclidean context, which yields a systematic procedure to "renormalise" otherwise divergent integrals appearing in generalised convolutions of functions with a singularity…

We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} \chi (x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} \chi_1 (x)\chi_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for…

In this note we axiomatize the classes of rudimentary functions, primitive recursive functions, safe recursive set functions, and predicatively computable functions.

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

For fixed positive integers $n$, we study the solution of the equation $n = k + p_k$, where $p_k$ denotes the $k$th prime number, by means of the iterative method \[ k_{j+1} = \pi(n-k_j), \qquad k_0 = \pi(n), \] which converges to the…

By a global approach, we prove the arithmetic fundamental lemma conjecture for unitary groups in $n$ variables over $\mathbb{Q}_p$ when $p\geq n$.

Let $p$ be a prime number and let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers. Let $N$ be a fully ramified, elementary abelian extension of $K$. Under a mild hypothesis on the extension $N/K$, we show that…

We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a rational reconstruction of Barzdins' liquid flow algorithm…