Related papers: Y is a least fixed point combinator
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…
We provide a type theoretic treatment of the paper "On Tarski's fixed point theorem" by Giovanni Curi. There are benefits to having a type theoretic formulation apart from routine implementation in a proof assistant. By taking advantage of…
A known Hardy-Littlewood theorem asserts that if both the function and its conjugate are of bounded variation, then their Fourier series are absolutely convergent. It is proved in the paper that the same result holds true for functions on…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…
In this note we axiomatize the classes of rudimentary functions, primitive recursive functions, safe recursive set functions, and predicatively computable functions.
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 define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive…
The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
We characterize the rearrangement invariant spaces for which there exists a non-constant fixed point, for the Hardy-Littlewood maximal operator (the case for the spaces $L^p(\mathbb{R}^{n})$ was first considered by Korry in \cite{Ko}). The…
The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function…
A folklore result in category theory is that a (weakly) Cartesian closed category with finite co-products is distributive. Usually, the proof of this small result is carried on using the fact that the exponential functor is right adjoint to…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
In this paper, we obtain coupled fixed point theorem for (\psi, \phi)-contractions under some generalized conditions on the real valued functions \psi and \phi defined on (0,\infinity). Also, we present a generalized version of coupled…
We discuss some surprising phenomena from basic calculus related to oscillating functions and to the theorem on the differentiability of inverse functions. Among other things, we see that a continuously differentiable function with a strict…
Startpoints (resp. endpoints) can be defined as "oriented fixed points". They arise naturally in the study of fixed for multi-valued maps defined on quasi-metric spaces. In this article, we give a new result in the startpoint theory for…
We describe simple criteria under which a given functor is naturally equivalent to an enriched one. We do this for several bases of enrichment, namely (pointed) simplicial sets, (pointed) topological spaces and orthogonal spectra. We also…