Related papers: The provably total recursive functions and the MRD…
We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…
We prove a structural result for measure preserving systems naturally associated with any finite collection of multiplicative functions that take values on the complex unit disc. We show that these systems have no irrational spectrum and…
We examine the noncommutative minimal model program for orders on arithmetic surfaces, or equivalently, arithmetic surfaces enriched by a Brauer class $\beta$. When $\beta$ has prime index $p>5$, we show the classical theory extends with…
We show that $\mathbf{C}$, a weak theory of sets with Axiom Beta, proves the scheme of Elementary, or $\Delta_0$ Transfinite Recursion and can generate, for every set, the corresponding relativized constructible hierarchy. We show that the…
We consider the relationship between learnability of a "base class" of functions on a set $X$, and learnability of a class of statistical functions derived from the base class. For example, we refine results showing that learnability of a…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…
Just as the $\lambda$-calculus uses three primitives (abstraction, application, variable) as the foundation of functional programming, inheritance-calculus uses three primitives (record, definition, inheritance) as the foundation of…
The theory of computation is based on abstract computing automata which can be classified into a three-class hierarchy: Finite Automata (FA), Push-down Automata (PDA) and the Turing Machines (TM). Each class corresponds to grammar/language…
In this short note, we give an elementary proof of a universal approximation theorem for neural networks with three hidden layers and increasing, continuous, bounded activation function. The result is weaker than the best known results, but…
A longstanding open problem is whether there exists a non syntactical model of the untyped lambda-calculus whose theory is exactly the least lambda-theory (l-beta). In this paper we investigate the more general question of whether the…
We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals, and then apply them to proving primitive recursiveness of some natural problems in linear algebra and analysis. In…
We study cyclic proof systems for $\mu\mathsf{PA}$, an extension of Peano arithmetic by positive inductive definitions that is arithmetically equivalent to the (impredicative) subsystem of second-order arithmetic $\Pi^1_2$-$\mathsf{CA}_0$…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We consider the classes of quasimultiplicative, semimultiplicative and Selberg multiplicative functions as extensions of the class of multiplicative functions. We apply these concepts to Ramanujan's sum and its analogue with respect to…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivant's result, however, is originally stated and proved only…