Related papers: A Survey on Lawvere's Fixed-Point Theorem
The objective of this manuscript is to introduce and develop the concept of a generalized $\theta$-parametric metric space-a novel extension that enriches the modern metric fixed point theory. We study of its fundamental properties,…
The classical Brouwer fixed point theorem states that in R^d every continuous function from a convex, compact set on itself has a fixed point. For an arbitrary probability space, let L^0 = L^0 (\Omega, A,P) be the set of random variables.…
The aim of this paper is to provide characterizations of a Meir-Keeler type mapping and a fixed point theorem for the mapping in a metric space endowed with a transitive relation.
We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula equations. We state and prove a fixed-point theorem for Horn…
The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…
In this paper, we prove common fixed point results for a self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize…
Fixed points represent equilibrium states, stability, and solutions to a range of problems. It has been an active field of research. In this paper, we provide an overview of the main branches of fixed point theory. We discuss the key…
Interactions between derivatives and fixpoints have many important applications in both computer science and mathematics. In this paper, we provide a categorical framework to combine fixpoints with derivatives by studying Cartesian…
The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…
In this article we discuss a possibility to implement a well-known scheme of proof for contraction mapping theorems in a situation, when convergence, families of Cauchy sequences, and contractiveness of mappings are defined axiomatically.…
The circumcentered-reflection method (CRM) has been recently proposed as a methodology for accelerating several algorithms for solving the Convex Feasibility Problem (CFP), equivalent to finding a common fixed-point of the orthogonal…
Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…
The purpose of this work is to complete the algebraic foundations of second-order languages from the viewpoint of categorical algebra as developed by Lawvere. To this end, this paper introduces the notion of second-order algebraic theory…
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
The aim of this paper is to prove a fixed point theorem on a generalised cone metric spaces for maps satisfying general contractive type conditions.
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…
In this paper, we investigate the existence and uniqueness of fixed points for self-mappings defined on bipolar metric spaces using a new class of contractive conditions, namely polynomial-type contractions. Our main results establish…
We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…
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…