Related papers: A Rice-like theorem for primitive recursive functi…
We construct a recursive formula for a complete system of primitive orthogonal idempotents for any $R$-trivial monoid. This uses the newly proved equivalence between the notions of $R$-trivial monoid and weakly ordered monoid.
We investigate the problem whether a function of several arguments can be reconstructed from its identification minors. We focus on functions with a unique identification minor, and we establish some positive and negative results on the…
Lurie's representability theorem gives necessary and sufficient conditions for a functor to be an almost finitely presented derived geometric stack. We establish several variants of Lurie's theorem, making the hypotheses easier to verify…
Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…
This paper is devoted to the study of quasi-periodic properties of fractional order integrals and derivatives of periodic functions. Considering Riemann-Liouville and Caputo definitions, we discuss when the fractional derivative and when…
Some simple nonlinear recursions which can be completely managed are identified and the behaviour of all their solutions is ascertained.
The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…
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 study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
It seems that the index theory for non-compact spaces has found its ultimate formulation in realm of coarse spaces and $K$-theory of related operator algebras. Relative and partitioned index theorems may be mentioned as two important and…
We consider the integral and derivative operators of tempered fractional calculus, and examine their analytic properties. We discover connections with the classical Riemann-Liouville fractional calculus and demonstrate how the operators may…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
We answer a question of Slaman and Steel by showing that a version of Martin's conjecture holds for all regressive functions on the hyperarithmetic degrees. A key step in our proof, which may have applications to other cases of Martin's…
We give an introduction to the transalgebraic theory of simply connected log-Riemann surfaces with a finite number of infinite ramification points (transalgebraic curves of genus $0$). We define the base vector space of transcendental…
It has been shown that a functional interpretation of proofs in mathematical analysis can be given by the product of selection functions, a mode of recursion that has an intuitive reading in terms of the computation of optimal strategies in…
Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…
We work with semi-algebraic functions on arbitrary real closed fields. We generalize the notion of critical values and prove a Sard type theorem in our framework.
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.