Related papers: Axiomatization of B\"uchi arithmetic

Motivated by the result that an `approximate' evaluation of the Jones polynomial of a braid at a $5^{th}$ root of unity can be used to simulate the quantum part of any algorithm in the quantum complexity class BQP, and results relating BQP…

This work presents a formalization of the theorem of existence of most general unifiers in first-order signatures in the higher-order proof assistant PVS. The distinguishing feature of this formalization is that it remains close to the…

Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…

We revisit, in an elementary way, the classical statement of various ``Main Conjectures'' for $p$-class groups $\mathcal{H}_K$ and $p$-ramified torsion groups $\mathcal{T}_K$ of abelian fields $K$, in the non semi-simple case $p \mid [K :…

The persisting gap between the formal and the informal mathematics is due to an inadequate notion of mathematical theory behind the current formalization techniques. I mean the (informal) notion of axiomatic theory according to which a…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

Building on our previous work on enriched universal algebra, we define a notion of enriched language consisting of function and relation symbols whose arities are objects of the base of enrichment. In this context, we construct atomic…

We present an elementary three pass algorithm for computing addition in Ostrowski numeration systems. When $a$ is quadratic, addition in the Ostrowski numeration system based on $a$ is recognizable by a finite automaton. We deduce that a…

We investigate expansions of Presburger arithmetic, i.e., the theory of the integers with addition and order, with additional structure related to exponentiation: either a function that takes a number to the power of $2$, or a predicate for…

Pecan is an automated theorem prover for reasoning about properties of Sturmian words, an important object in the field of combinatorics on words. It is capable of efficiently proving non-trivial mathematical theorems about all Sturmian…

Let $G$ be a multiplicative subgroup of $\mathbb{Q}_p$. In this paper, we describe the theory of the pair $(\mathbb{Q}_p, G)$ under the condition that $G$ satisfies Mann property and is small as subset of a first-order structure. First, we…

Family of quasi-arithmetic means has a natural, partial order (point-wise order) $A^{[f]}\le A^{[g]}$ if and only if $A^{[f]}(v)\le A^{[g]}(v)$ for all admissible vectors $v$ ($f,\,g$ and, later, $h$ are continuous and monotone and defined…

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

We introduce a class of rational functions $A:\,\mathbb C\mathbb P^1\rightarrow \mathbb C\mathbb P^1$ which can be considered as a natural extension of the class of Latt\`es maps and establish basic properties of functions from this class.

We axiomatize the provability logic of $\HA$ and prove its decidability. Furthermore, we axiomatize the preservativity and relative admissibility relations for several modal logics extending iK4. A principal technical tool is the…

The main goal of this paper is to construct an algebraic analogue of quasi-plurisubharmonic function (qpsh for short) from complex analysis and geometry. We define a notion of qpsh function on a valuation space associated to a quite general…

In this article we introduce the concept of almost $\mathcal{P}$-numbers. We survey the existing results in literature for almost cyclic numbers and give characterizations for almost abelian and almost nilpotent numbers proving these two…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

For any $p\in[1,\infty)$, we prove that the set of simple functions taking at most $k$ different values is proximinal in B\"ochner spaces $L^p(X)$ whenever $X$ is a dual Banach space with $w^*$-sequentially compact unit ball. With…

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…