In this paper, we prove that an implicit iterative process with er-rors converges strongly to a common xed point for a nite family of generalizedasymptotically quasi-nonexpansive mappings on unbounded sets in a uniformlyconvex Banach space. Our results unify, improve and generalize the correspond-ing results of Ud-din and Khan [4], Sun [21], Wittman [23], Xu and Ori [26] andmany others.

Jachymski [ Proc. Amer. Math. Soc., 136 (2008), 1359-1373] gave modified version of a Banach fixed point theorem on a metric space endowed with a graph. In the present paper, (G, Φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. Also, Hardy-Rogers G-contraction have been introduced and some fixed point theorems have been proved. S...

This paper, and the preceding one, survey two types of formalism which has proved to be particularly successful for eecient automatic verii-cation, or \model checking", of concurrent systems. In the previous paper we considered branching time propositional temporal logics, and now we turn to a more general formalism, the propositional-calculus. The emphasis, as before, is on a broad understandi...

in this paper, we prove the existence of fixed point for j-type multi-valuedmap t in cat(0) spaces and also we prove the strong convergence theoremsfor ishikawa iteration scheme without using the xed point of involving map.

Some fixed point theorems based on an asymptotic regularity condition have been obtained, which generalize the previously well-known results. 2000 Mathematics Subject Classification: 47H10, 54H25.

Fixed points play a central role in domain theory, where, traditionally, the least-xed-point operator for continuous endofunctions on complete partial orders (cpos) is used. Recently, there has been considerable interest in developing a more general axiomatic (and order-free) account of the constructions of domain theory. Peter Freyd made an essential contribution to this programme by emphasisi...

Let f be a quadratic polynomial which has an irrationally indi erent xed point Let z be a biaccessible point in the Julia set of f Then In the Siegel case the orbit of z must eventually hit the critical point of f In the Cremer case the orbit of z must eventually hit the xed point Siegel polynomials with biaccessible critical point certainly exist but in the Cremer case it is possible that biac...

Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this assertion is for RSA-type cryptosystems over elliptic curves. The analysis is more diicult because the underlying groups are not always cyclic. Previous papers suggested the use of strong primes in order to prevent fact...

In this paper, we have developed and analysed per models for recursive types, polymorphism, and subtyping. In developing our models, the emphasis has been on simplicity and on understanding the necessity of any conditions we impose on our structures. While similar structures have been given using the interpretation of constructive logic in a topos, the presentation of the models here is more di...