1. Bauer, A. "The Realizability Approach to Computable Analysis and Topology". PhD thesis, Carnegie Mellon University, 2000
2. Wadge hierarchy and Veblen hierarchy. Part I: Borel sets of finite rank;Duparc;J. Symbol. Logic,2001
3. Duparc, J. Wadge hierarchy and Veblen hierarchy. Part II: Borel sets of infinite rank. (submitted to J. Symbol. Logic)
4. Theory of domains and nearby;Ershov;Lecture Notes of Computer Science,1993
5. Giertz, G., K.H. Hoffmann, K. Keimel, J.D. Lawson, M.W. Mislove and D.S. Scott. "Continuous Lattices and Domains", Cambridge, 2003