We give a completeness theorem for a logic with probability quantifiers which is equivalent to the logics described in a recent survey paper of Keisler [K]. This result improves on the completeness ...
In this paper, we improve Caristi-Jachymski-SteinJr and Banach-Caristi type fixed point theorems by relaxing the strong continuity assumption of the mapping with some weaker continuity notions. As an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback