Related papers: Total Recursion over Lexicographical Orderings: El…
While research on iterated revision is predominant in the field of iterated belief change, the class of iterated contraction operators received more attention in recent years. In this article, we examine a non-prioritized generalisation of…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
Intelligence-biological, artificial, or collective-requires structural coherence across recursive reasoning processes to scale effectively. As complex systems grow, coherence becomes fragile unless a higher-order structure ensures semantic…
We study the possibility to reconstruct the primordial function for some periodic function. The procedure includes an analytical continuation of a discrete function for Fourier coefficients computation, that introduces an ambiguity. To…
The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable…
We investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On the one hand, it is well-known that every first-order predicate modal logic complete with respect to…
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…
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 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…
It is well known that many theorems in recursion theory can be "relativized". This means that they remain true if partial recursive functions are replaced by functions that are partial recursive relative to some fixed oracle set. Uspensky…
We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…
The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…
We identify a structural property of term-rewriting proof systems called operational inexpressibility: no derivation depends on a specified input dimension and also constrains the target question. The canonical instance is direct…
Observing the existing relationships between the elementary operations of addition, multiplication (iteration of additions) and exponentiation (iteration of multiplications), a new operation (named incrementation) is defined, consistently…
For any representation of a complex simple Lie algebra $\mathfrak{sl}_n$, one problem of branching rules to $\mathfrak{sl}_2$-subalgebra is to determine the multiplicity of each irreducible component. In this paper, we derive a recursion…
A construction of general solutions of the \hbar-dependent Toda hierarchy is presented. The construction is based on a Riemann-Hilbert problem for the pairs (L,M) and (\bar L,\bar M) of Lax and Orlov-Schulman operators. This Riemann-Hilbert…
We consider the recursion operators with nonlocal terms of special form for evolution systems in (1+1) dimensions, and extend them to well-defined operators on the space of nonlocal symmetries associated with the so-called universal Abelian…
By the sometimes so-called MAIN THEOREM of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS'2000), Brattka (MLQ'2005), and Ziegler (ToCS'2006) have considered different relaxed notions…
We show under the Generalised Riemann Hypothesis that for every $\delta>0$, almost every prime $q$ in $[Q,2Q]$ has the expected of prime primitive roots in the interval $[x,x+x^{\frac{1}2+\delta}]$ provided $Q$ is not more than…