Related papers: On Interpretations in B\"uchi Arithmetics
A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…
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.
Suppose B is the unital algebra consisting of the algebraic product of full matrix algebras over an index set X. A bijection is set up between the equivalence classes of irreducible representations of B as operators on a Banach space and…
This paper serves to define an extension, which we call dimensional Veblen, of Oswald Veblen's system of ordinal functions below the large Veblen ordinal. This is facilitated by iterating derivatives of ordinal functions along…
The duality of uniform approximation property for Banach spaces is well known. In this note, we establish, under the assumption of local reflexivity, the duality of uniform approximation property in the category of operator spaces.
We give an alternative presentation of the ordinal notation at the strength of $\Pi^1_1-CA_0$ which allows the "uncountable" notation $\Omega$ to be interpreted "polymorphically" - that is, we allow the notation to be interpreted as…
We prove that if a set $B$ in a Banach space $X$ can be written as an increasing, countable union $B=\cup_n B_n$ of sets $B_n$ such that no $B_n$ is uniform boundedness deciding, then also $B$ is not uniform boundedness deciding. From this…
Combining abstract, symbolic reasoning with continuous neural reasoning is a grand challenge of representation learning. As a step in this direction, we propose a new architecture, called neural equivalence networks, for the problem of…
Multiset automata are a class of automata for which the symbols can be read in any order and obtain the same result. We investigate weighted multiset automata and show how to construct them from weighted regular expressions. We present…
Understanding AI systems' inner workings is critical for ensuring value alignment and safety. This review explores mechanistic interpretability: reverse engineering the computational mechanisms and representations learned by neural networks…
Let $A$ and $B$ be sets of nonnegative integers. For a positive integer $n$ let $R_{A}(n)$ denote the number of representations of $n$ as the sum of two terms from $A$. Let $\displaystyle s_{A}(x) = \max_{n \le x}R_{A}(n)$ and…
Given a category of objects, it is both useful and important to know if all the objects in the category may be realised as sub-objects -- via morphisms in the given category -- of a single object in that category enjoying some nice…
We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.
This paper studies the restriction multiplicities of half-diagram modules for the partition algebra and their geometric interpretations. By specializing the Bowman-De Visscher-Orellana formula [BVC, Theorem 4.3] for restriction…
Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…
Connectionist approaches to machine learning, \emph{i.e.} neural networks, are enjoying a considerable vogue right now. However, these methods require large volumes of data and produce models that are uninterpretable to humans. An…
We investigate the mathematical structure of unit systems and the relations between them. Looking over the entire set of unit systems, we can find a mathematical structure that is called preorder (or quasi-order). For some pair of unit…
We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$…
An expression is any mathematical formula that contains certain formal variables and operations to be executed in a specified order. In computer science, it is usually convenient to represent each expression in the form of an expression…
An open set U of the real numbers R is produced such that the expansion (R,+,x,U) of the real field by U defines a Borel isomorph of (R,+,x,N) but does not define N. It follows that (R,+,x,U) defines sets in every level of the projective…