Related papers: Axiomatization of B\"uchi arithmetic

In the present article, we introduce beta-expansions in the ring $\mathbb{Z}_p$ of $p$-adic integers. We characterise the sets of numbers with eventually periodic and finite expansions.

The B\^{o}cher-Grace Theorem can be stated as follows: Let $p$ be a third degree complex polynomial. Then there is a unique inscribed ellipse interpolating the midpoints of the triangle formed from the roots of $p$, and the foci of the…

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…

We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computational complexities of p-equivalence problems for regular…

Let $U$ be a bounded open subset of the complex plane and let $A_{\alpha}(U)$ denote the set of functions analytic on $U$ that also belong to the little Lipschitz class with Lipschitz exponent $\alpha$. It is shown that if $A_{\alpha}(U)$…

With an artificial (p', n')-system it has been proved that even numbers > (p(x))^2 are the sum of two p > p(x).

We study analytic function interpolating the multiple generalized Euler numbers attached to $\chi$ at negative integers.

A comparison of the "theory of random sequences" developed during the twentieth century and the axiomatic approach of probability theory proposed by Kolmogorov shows the importance of sigma-additivity as extension tool. Similarly, the…

We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…

A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…

We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but…

We propose an implementation of lambda+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. The rewrite system of lambda+ is a rewrite system modulo an equivalence relation, which makes its…

Infinite words over infinite alphabets serve as models of the temporal development of the allocation and (re-)use of resources over linear time. We approach omega-languages over infinite alphabets in the setting of nominal sets, and study…

This is a detailed and self-contained introduction to the real number system from a categorical perspective. We begin with the categorical definition of the natural numbers, review the Eudoxus theory of ratios as presented in Book V of…

Using a Zariski topology associated to a finite field extensions, we give new proofs and generalize the primitive and normal basis theorems.

We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…

System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

We introduce a method to derive theorems from Elementary Number Theory by means of relationships among formal languages. Using $\sigma$-algebras, we define what a proof of a number-theoretical statement by Language Theory means. We prove…

Potential theory for rational approximation is reviewed by means of examples computed with the AAA algorithm.