Results 31 to 40 of about 1,628,955 (269)
On Essential Fixed Points [PDF]
Proceedings of the American Mathematical Society, 1959 Wenn jede stetige Abbildung des kompakten Hausdorffschen Raumes \(X\) in sich wenigstens einen Fixpunkt hat, so ist \(p \in X\) wesentlicher Fixpunkt von \(f: X \rightarrow p\). [\glqq Wesentlich\grqq{} bedeutet: Zu jeder Umgebung \(U\) von \(p\) gibt es in \(X^X\) (kompakt-offen topologisiert) eine Umgebung \(N\) von \(f\), so daß jedes \(g \in N ...
openaire +2 more sources
Intuitionistic fixed point logic [PDF]
Annals of Pure and Applied Logic, 2021 We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction ...
Ulrich Berger 0001, Hideki Tsuiki
openaire +3 more sources
IEEE Access, 2020 In this article, we propose a modified conjugate descent (CD) projection algorithm for solving system of nonlinear monotone equations with convex constraints.
Sani Aji +4 more
doaj +1 more source
Advances in Difference Equations, 2021 This paper provides iterative construction of a common solution associated with the classes of equilibrium problems (EP) and split convex feasibility problems.
Yasir Arfat +4 more
doaj +1 more source
Fractional order mathematical modeling of typhoid fever disease
Results in Physics, 2022 This manuscript is devoted to focusing on the modeling and numerical solution of the dynamical model of Typhoid Fever. We use the Atangana–Baleanu operator with the Mittag–Leffler function in Caputo sense to study the behavior of the model.
Muhammad Sinan +6 more
doaj +1 more source
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Analysis and Geometry in Metric Spaces, 2023 This article analyses two schemes: Mann-type and viscosity-type proximal point algorithms. Using these schemes, we establish Δ-convergence and strong convergence theorems for finding a common solution of monotone vector field inclusion problems, a ...
Salisu Sani +2 more
doaj +1 more source
Bulletin of the American Mathematical Society, 1982 A fixed point algebra (FPA) is a pair \(\) of Boolean algebras satisfying the following properties: (1) Each \(\alpha \in B\) is a mapping from A into A; (2) Boolean operations in B are pointwise on A; (3) each constant mapping on A is an element of B; (4) each \(\alpha \in B\) has a fixed point in A.
openaire +2 more sources
On fixed points of permutations [PDF]
Journal of Algebraic Combinatorics, 2008 The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete classification of the limiting distributions is given.
Diaconis, Persi +2 more
openaire +3 more sources
Unique fixed points vs. least fixed points
Theoretical Computer Science, 1980 AbstractThe aim of this paper is to compare two approaches to the semantics of programming languages: the least fixed point approach, and the unique fixed point approach. Briefly speaking, we investigate here the problem of existence of extensions of algebras with the unique fixed point property to ordered algebras with the least fixed point property ...
openaire +2 more sources