On r.e. inseparability of CPO index sets
暂无分享,去创建一个
[1] David Michael Ritchie Park,et al. When are two Effectively given Domains Identical? , 1979, Theoretical Computer Science.
[2] J. Ersov. Theorie der Numerierungen II , 1973 .
[3] J. Dekker,et al. Some theorems on classes of recursively enumerable sets , 1958 .
[4] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[5] K. Hofmann,et al. A Compendium of Continuous Lattices , 1980 .
[6] G. Plotkin. Tω as a Universal Domain , 1978 .
[7] Michael B. Smyth,et al. Effectively given Domains , 1977, Theor. Comput. Sci..
[8] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .
[9] Edward Sciore,et al. Admissible Coherent CPO's , 1978, ICALP.
[10] Robert L. Constable,et al. Computability Concepts for Programming Language Semantics , 1976, Theor. Comput. Sci..