Related papers: Replication via Invalidating the Applicability of …
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…
We construct a complete lattice $Z$ such that the binary supremum function $\sup:Z\times Z\to Z$ is discontinuous with respect to the product topology on $Z\times Z$ of the Scott topologies on each copy of $Z$. In addition, we show that…
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…
Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
A Fixed-Parameter Tractable (\FPT) $\rho$-approximation algorithm for a minimization (resp. maximization) parameterized problem $P$ is an FPT algorithm that, given an instance $(x, k)\in P$ computes a solution of cost at most $k \cdot…
Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of lambda-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc's), vastly…
We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…
The generic structure of 4-point functions of fields residing in indecomposable representations of arbitrary rank is given. The presented algorithm is illustrated with some non-trivial examples and permutation symmetries are exploited to…
This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…
Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…
We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…
We use the method of monotone iterations to obtain fixed point and coupled fixed point results for mixed monotone operators in the setting of partially ordered sets, with no additional assumptions on the partial order and with no…
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and non-computable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for…
Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.
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 are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…
This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…