Powerdomains and modality, revisited with detailed proofs
COMPUTER MODELLING & NEW TECHNOLOGIES 2016 20(3) 24-31
Network & Information Center, East China Normal University, Shanghai, 200062, China
We give direct detailed proofs for the connection between powerdomains and logic models which can be made about nondetermin- istic computations. In the proceeding of proofs, we prove some algebraic properties of them at the same time. Meanwhile, we take up some trick for constructing the finite branching tree, which can also be used into the other areas.