Related papers: Y is a least fixed point combinator

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

Stationary points or derivative zero crossings of a regression function correspond to points where a trend reverses, making their estimation scientifically important. Existing approaches to uncertainty quantification for stationary points…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

A parametric version of Brouwer's Fixed Point Theorem, which is proven using the fixed-point index, states that for every continuous mapping $f : (X \times Y) \to Y$, where $X$ is nonempty, compact, and connected subset of a Hausdorff…

We present the theorem which determines, by a permutation, the cardinal ordering of fixed points for any orbit of a period doubling cascade. The inverse permutation generates the orbit and the symbolic sequence of the orbit is obtained as a…

We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…

We establish a coupled fixed points theorem for a meaningful class of mixed monotone multivalued operators and then we use it to derive some results on existence of quasisolutions and solutions to first--order functional differential…

In this research summary we present our recent work on implementing functional patterns with inverse functions in the lazy functional-logic programming language Curry. Our goal is the synthesis of the inverse of any given function in Curry…

In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the algebraic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras…

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

In this work, we establish some coincidence point results for self-mappings satisfying rational type contractions in generalized metric spaces in the sense of Branciari [7]. Presented coincidence point theorems weak and extend numerous…

In this paper, we show a series of abstract results on fixed point regularity with respect to a parameter. They are based on a Taylor development taking into account a loss of regularity phenomenon, typically occurring for composition…

We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-calculus with a pattern matching mechanism for variadic…

We introduce two notions of a contractive orbit of a set-valued map defined in a first countable space. The first defines the contraction with respect to the topology of the underlying space while the second defines the contraction with…

In this paper, we introduce the new concepts of subcompatibility and subsequential continuity which are respectively weaker than occasionally weak compatibilty and reciprocal continuity. With them, we establish several common fixed point…

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…