Results 271 to 280 of about 1,116,885 (306)
Information Processing Letters, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C.J. Aarts +8 more
openaire +2 more sources
gmj, 2002 Abstract Some fixed point theorems based on an asymptotic regularity condition have been obtained, which generalize the previously well-known results.
M. S. Khan +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the American Mathematical Society, 1982
In this paper, we develop a machine which enables us to predict, in many cases, the exact number of fixed points of a local diffeomorphism. Though much more general, our technique applies in particular to locally expansive maps on compact, connected, orientable differentiable manifolds.
openaire +2 more sources
In this paper, we develop a machine which enables us to predict, in many cases, the exact number of fixed points of a local diffeomorphism. Though much more general, our technique applies in particular to locally expansive maps on compact, connected, orientable differentiable manifolds.
openaire +2 more sources
2008
This article gives statements of the Tarski fixed point theorem and the main versions of the topological fixed point principle that have been ...
openaire +1 more source
This article gives statements of the Tarski fixed point theorem and the main versions of the topological fixed point principle that have been ...
openaire +1 more source
Fixed points of products and the strong fixed point property
Order, 1987The paper is motivated by the well known open problem: If ordered sets X and Y both have the fixed point property (fpp), will their product XY also have the fixed point property? The authors introduce what they call the strong fixed point property: An ordered set X has the strong fixed point property if there is an order preserving map \(\Phi\) of \(X^
Dwight Duffus, Norbert Sauer
openaire +3 more sources
Incompleteness and Fixed Points
MLQ, 2002Summary: Our purpose is to present some connections between modal incompleteness and modal logics related to the Gödel-Löb logic GL. One of our goals is to prove that for all \(m,n,k,l \in\mathbb{N}\) the logic \(\text{K}+\bigwedge_{i=m}^n \square^i (\bigwedge^l_{j=k} \square^j p\leftrightarrow p)\to \bigwedge^n_{i=m} \square^ip\) is incomplete and ...
openaire +3 more sources
Archiv der Mathematik, 1997
We prove a fixed point theorem for the action of a Lie group \(G\) acting isometrically on a non-negatively curved Riemannian manifold with principal orbits which are isotropy irreducible homogeneous spaces. We refine our result when the curvature is positive and give a possible application to the study of immersions of homogeneous spaces into spheres.
openaire +3 more sources
We prove a fixed point theorem for the action of a Lie group \(G\) acting isometrically on a non-negatively curved Riemannian manifold with principal orbits which are isotropy irreducible homogeneous spaces. We refine our result when the curvature is positive and give a possible application to the study of immersions of homogeneous spaces into spheres.
openaire +3 more sources
Fixed points vs. coupled fixed points
Journal of Fixed Point Theory and Applications, 2018In this paper, we will show some connections between fixed point and coupled fixed point problems in Banach and metric spaces.
openaire +2 more sources
Mathematical Logic Quarterly, 1988
The paper establishes some general conditions under wich a formula A(p) has only provable fixed points in Guaspari-Solovay modal logic of provability R. This result is used to give another proof of Parikh's theorem: For each natural number \(k\geq 1\) there is an arithmetical sentence A, provable in PA, such that \(\square^ kA\) has a much shorter ...
Franco Montagna, Dick de Jongh
openaire +3 more sources
The paper establishes some general conditions under wich a formula A(p) has only provable fixed points in Guaspari-Solovay modal logic of provability R. This result is used to give another proof of Parikh's theorem: For each natural number \(k\geq 1\) there is an arithmetical sentence A, provable in PA, such that \(\square^ kA\) has a much shorter ...
Franco Montagna, Dick de Jongh
openaire +3 more sources