Related papers: Ordinal Recursion Theory
In the context of reverse mathematics, effective transfinite recursion refers to a principle that allows us to construct sequences of sets by recursion along arbitrary well orders, provided that each set is $\Delta^0_1$-definable relative…
This is a survey article on Mercer's Theorem in its most general form and its relations with the theory of reproducing kernel Hilbert spaces and the spectral theory of compact operators. We provide a modern introduction to the basics of the…
The main goal of this paper is to assign two combinatorial interpretations to the elements of the Rascal Triangle defined by Angorro et al. The first interpretation involves counting ascents in binary words, while the second interpretation…
This paper extends the class of ordinal regression models with a structured interpretation of the problem by applying a novel treatment of encoded labels. The net effect of this is to transform the underlying problem from an ordinal…
We discuss properties of recursive schemas related to McCarthy's ``91 function'' and to Takeuchi's triple recursion. Several theorems are proposed as interesting candidates for machine verification, and some intriguing open questions are…
We establish the various properties as well as diverse relations of the ascent and descent spectra for bounded linear operators. We specially focus on the theory of subspectrum. Furthermore, we construct a new concept of convergence for…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We consider fractional differential equations of order $\alpha \in (0,1)$ for functions of one independent variable $t\in (0,\infty)$ with the Riemann-Liouville and Caputo-Dzhrbashyan fractional derivatives. A precise estimate for the order…
In this paper, we investigate the power of nearly purely operational techniques in the study of umbral calculus. We present a concise reconstruction of the theory based on a systematic use of linear operators, with particular attention to…
We introduce a renormalization procedure which allows us to study in a unified and concise way different properties of the irrational rotations on the unit circle $\beta \mapsto \set{\alpha+\beta}$, $\alpha \in \R\setminus \Q$. In…
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…
Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…
Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
In this paper ideas of different types of convergence of a sequence of random variables in probability, namely, statistical convergence of order $\alpha$ in probability, strong $p$-Ces$\grave{\mbox{a}}$ro summability of order $\alpha$ in…
We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the principal classification tools, notably to Descriptive Set Theory, Computability theory and Automata Theory. While the classical hierarchies…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…
In this paper we consider transfinite provability logics where for each ordinal in some recursive well-order we have a corresponding modal provability operator. The modality [xi] will be interpreted as "provable in ACA_0 together with at…
We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta^0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'s…