Related papers: Order-theoretical fixed point theorems for corresp…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
In this paper, we study the existence of fixed points for mappings defined on complete metric space (X, d) satisfying a general contractive inequality of integral type depended on another function. This conditions is analogous of Banach…
In this article, we investigate some fixed point results satisfying a new generalized $\Delta$-implicit contractive condition in ordered complete multiplicative $\mathbf{G}_\mathcal{M}-$metric space. Also, some new definitions and fixed…
We summarize some facts on chains (totally ordered sets), from an order-theoretic and from a topological point of view. We highlight the fact that many classical theorems that are true for partially ordered sets under some completeness…
This gives two existence results of alpha-core solutions by introducing P-open conditions and strong P-open conditions into games without ordered preferences. The existence of alpha-core solutions is obtained for games with…
Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of…
We deal with inverse maximum theorems, which are inspired by the ones given by Aoyama, Komiya, Li et al., Park and Komiya, and Yamauchi. As a consequence of our results, we state and prove an inverse maximum Nash theorem and show that any…
We prove that if a continuous piecewise-smooth map on $\mathbb{R}^n$ is comprised of two linear functions, has a bounded orbit, and satisfies a certain non-degeneracy condition, then it has a fixed point. The result has important…
It is shown that the set of all finitary consequence operators defined on any nonempty language is a join-complete lattice. This result is applied to various collections of physical theories to obtain an unrestricted supremum unification.
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.…
We provide some examples showing how game-theoretic arguments can be used in computability theory and algorithmic information theory: unique numbering theorem (Friedberg), the gap between conditional complexity and total conditional…
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…
In this paper, first we have established two sets of sufficient conditions for a mapping to have unique fixed point in a intuitionistic fuzzy metric space and then we have redefined the contraction mapping in a intuitionistic fuzzy metric…
In classical game theory, optimal strategies are determined for games with complete information; this requires knowledge of the opponent's goals. We analyze games when a player is mistaken about their opponents goals. For definitiveness, we…
The fixed-point theory and its applications to various areas of science are well known. In this paper we present some existence and uniqueness theorems for fixed circles of self-mappings on metric spaces with geometric interpretation. We…
We propose a new determinacy hypothesis for transfinite games, use the hypothesis to extend the perfect set theorem, prove relationships between various determinacy hypotheses, expose inconsistent versions of determinacy, and provide a…
We consider a repeated game in which players, considered as nodes of a network, are connected. Each player observes her neighbors' moves only. Thus, monitoring is private and imperfect. Players can communicate with their neighbors at each…
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below…
We prove two general decomposition theorems for fixed-point invariants: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar additivity results for these invariants. Moreover, the proofs of…
Automata networks, and in particular Boolean networks, are used to model diverse networks of interacting entities. The interaction graph of an automata network is its most important parameter, as it represents the overall architecture of…