Related papers: Fixed Point Theorems in Computability Theory
Following the definition of perturbed metric space, in this paper, some fixed point theorems are established for $ F $-perturbed mappings in complete perturbed metric spaces and justify the result by counter example. Finally, an application…
We survey several applications of fixed point theorems in the theory of invariant subspaces. The general idea is that a fixed point theorem applied to a suitable map yields the existence of invariant subspaces for an operator on a Banach…
In this article, we demonstrate the common fixed point theorems for three transformations on vector S-metric space by utilizing weakly compatible and point of coincidence. Moreover, some of our results generalize the existing results in the…
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…
In this present article, we etablish some existence results of $\varphi-$fixed point of a mapping in a $C^{\ast}$-algebra valued metric spaces and we deduce some fixed point theorems in $C^{\ast}$-algebra valued partial metric spaces.…
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
In this paper we are going to prove a very general fixed point theorem for mappings acting in partial metric spaces. In that theorem we impose some conditions on behavior of considered mappings on orbits and a condition relating orbits of…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
Two open problems in the fixed point theory of quasi metric spaces posed in [Berinde, V. and Choban, M. M., {\it Generalized distances and their associate metrics. Impact on fixed point theory}, Creat. Math. Inform. {\bf 22} (2013), no. 1,…
In this paper, we introduce a new type of coupled fixed point theorem in partially ordered complete metric space. We give an example to support of our result.
The aim of this paper is to present some fixed point theorems for generalized contractions by altering distance functions in a complete cone metric spaces endowed with a partial order. We also generalize fixed point theorems of J. Harjani,…
In this work we state a Theorem on number theory and apply it to solve some ordinary and partial differential equations.
The main purpose of this work is to extend the properties of multivalued transformations to the integral type transformations and to obtain the existence of fixed points under F-contraction. In addition, the results of this study were…
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…
This paper reviews connections between physics and computation, and explores their implications. The main topics are computational "hardness" of physical systems, computational status of fundamental theories, quantum computation, and the…
In this paper, we give common coincidence point and common fixed point theorems for four self maps in the setting of generalized TAC-contraction in partial b-metric space. Also, we give an example to authenticate the viability of the…
We consider a class of formula equations in first-order logic, Horn formula equations, which are defined by a syntactic restriction on the occurrences of predicate variables. Horn formula equations play an important role in many…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
In this survey article (which hitherto is an ongoing work-in-progress) we present the formulation of the induction and coinduction principles using the language and conventions of each of order theory, set theory, programming languages'…