Related papers: A Rice-like theorem for primitive recursive functi…
Neither the classical nor intuitionistic logic traditions are perfectly-aligned with the purpose of reasoning about computation, in that neither tradition can permit unconstrained recursive definitions without inconsistency: recursive…
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…
The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that…
We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…
When the Canonical Ramsey's Theorem by Erd\H{o}s and Rado is applied to regressive functions one obtains the Regressive Ramsey's Theorem by Kanamori and McAloon. Taylor proved a "canonical" version of Hindman's Theorem, analogous to the…
Let $\Mod \CS$ denote the category of $\CS$-modules, where $\CS$ is a small category. In the first part of this paper, we provide a version of Rickard's theorem on derived equivalence of rings for $\Mod \CS$. This will have several…
A fast approximation to the Boys functions (related to the lower incomplete gamma function of half-integer parameter) by a single closed-form analytical expression for all argument values have been developed and tested. Besides the…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
In this paper, we introduce and study two new classes of commutative rings, namely semi transitional rings and transitional rings, which extend several classical ideas arising from rings of continuous functions and their variants. A general…
Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, G\"odel incompleteness theorems, inconsistency provability for set theory, constructive…
In 2012 Chen and Singer introduced the notion of discrete residues for rational functions as a complete obstruction to rational summability. More explicitly, for a given rational function f(x), there exists a rational function g(x) such…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…
We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$,…
For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
Starting from a generalized Reedy category $R$ satisfying a simple condition, we construct an absolutely dense functor $\mathbf{D}_R \to R$ with domain a strict Reedy category. In the case of a generalized inverse category $R$, and given…
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…