"This paper deals with some existence results for a class of implicit fractional q-difference equations. The are based on the fi xed point theory in Banach spaces and concept measure noncompactness. An illustrative example is given last section."

A nonlinear generalization of the S-transform known in Gaussian analysis is introduced. It is deened as a nonlinear operator on topolog-ical spaces of entire functions of innnitely many variables with growth of at most second order and nite type restricted to a certain value. This nonlinear S-transform (NLST) has xed points a certain family of which is found and analyzed. In particular, their s...

Given any positive sequence {cn}n∈N, we construct orientation preserving homeomorphisms f : R → R such that Fix(f) = Per(f) = {0}, 0 is Lyapunov stable and lim sup |i(f ,0)| cm = ∞. We will use our results to discuss and to point out some strong di erences with respect to the computation and behavior of the sequences of the indices of planar homeomorphisms.

In this paper we introduce the concept of generalized weakly contractiveness for a pair of multivalued mappings in a metric space. We then prove the existence of a common fixed point for such mappings in a complete metric space. Our result generalizes the corresponding results for single valued mappings proved by Zhang and Song [14], as well as those proved by D. Doric [4].

recently, rahimi et al. [comp. appl. math. 2013, in press] dened the conceptof quadrupled xed point in k-metric spaces and proved several quadrupled xed pointtheorems for solid cones on k-metric spaces. in this paper some quadrupled xed point resultsfor t-contraction on k-metric spaces without normality condition are proved. obtainedresults extend and generalize well-known comparable result...

We consider quasi-metrics as a technical tool for use in theoretical computer science. In particular, we discuss their use in nding xed points of operators arising in programming language semantics, especially those arising in logic programming .

Induction for Horn clauses from data received a major boost from the success of FOIL 1;2;3 as a pioneer clausal learning algorithm. FOIL attempts to explain a target relation (while avoiding a negative set) by incrementally adding clauses that successively increase this explained part. The residue of the target set is obtained by postulating the target set in the antecedents (body) of the gener...