Common fixed point theorems for occasionally weakly compatible mappings under relaxed conditions (Q975255)

The authors establish several common fixed point theorems for two maps and four maps without using the (E.A.) property and completeness, under a relaxed condition on \(d\), without using the the triangle inequality and assuming symmetry only on the set of points of coincidence. An application to dynamical programming is also given.