Related papers: On Interpretations in B\"uchi Arithmetics

Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of deterministic automata whilst maintaining some of their desirable…

Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…

This paper describes an axiomatic theory BT for constructive mathematics. BT has a predicative comprehension axiom for a countable number of set types and usual combinatorial operations. BT has intuitionistic logic, is consistent with…

We analyze a definition of product of Banach spaces that is naturally associated by duality with an abstract notion of space of multiplication operators. This dual relation allows to understand several constructions coming from different…

Let $k,\ell\geq 2$ be two multiplicatively independent integers. Cobham's famous theorem states that a set $X\subseteq \mathbb{N}$ is both $k$-recognizable and $\ell$-recognizable if and only if it is definable in Presburger arithmetic.…

We define quantum bi-Hamiltonian systems, by analogy with the classical case, as derivations in operator algebras which are inner derivations with respect to two compatible associative structures. We find such structures by means of the…

Probabilistic B\"uchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of…

Branching of symplectic groups is not multiplicity-free. We describe a new approach to resolving these multiplicities that is based on studying the associated branching algebra $B$. The algebra $B$ is a graded algebra whose components…

We use elementary algebraic properties of left, right multiplication operators to prove some deep structural properties of left $m$-invertible, $m$-isometric, $m$-selfadjoint and other related classes of Banach space operators, often adding…

Let $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]} \b n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot]$ is the greatest integer function. In the paper we present a summation formula and several congruences involving $\{U_n\}$.

In 2008, Lehner, Wettig, Guhr and Wei conjectured a power series identity and showed that it implied a determinantal formula for a Bessel-type integral over the unitary supergroup. The integral is the supersymmetric extension of Bessel-type…

The notion of a root functional of a system of polynomials or ideal of polynomials is a generalization of the notion of a root, in particular, for a multiple root. A root functional is a linear functional that is defined on a polynomial…

In a recent paper, Enayat and Le lyk [2024] show that second order arithmetic and countable set theory are not definitionally equivalent. It is well known that these theories are biinterpretable. Thus, we have a pair of natural theories…

Decision Diagrams(DDs) are one of the most popular representations for boolean functions. They are widely used in the design and verification of circuits. Different types of DDs have been proven to represent important functions in…

We solve a generalization of B\"uchi's problem in any exponent for function fields, and briefly discuss some consequences on undecidability. This provides the first example where this problem is solved for rings of functions in the case of…

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

A bi-univalent function is a univalent function defined on the unit disk with its inverse also univalent on the unit disk. Estimates for the initial coefficients are obtained for bi-univalent functions belonging to certain classes defined…

Traditional Turing machines are semantically poor, they only concern the syntactic manipulation of symbols, discarding the mathematical semantics behind the symbols. This semantic deficiency is considered the root cause of the three major…

A simple Neural Network model is presented for end-to-end visual learning of arithmetic operations from pictures of numbers. The input consists of two pictures, each showing a 7-digit number. The output, also a picture, displays the number…