Highlights of the Rice-Shapiro Theorem in Computable Topology
暂无分享,去创建一个
[1] Arno Pauly,et al. A comparison of concepts from computable analysis and effective descriptive set theory , 2014, Mathematical Structures in Computer Science.
[2] Klaus Weihrauch,et al. Elementary Computable Topology , 2009, J. Univers. Comput. Sci..
[3] Y. Moschovakis. Recursive metric spaces , 1964 .
[4] Douglas Cenzer,et al. Index Sets in Computable Analysis , 1999, Theor. Comput. Sci..
[5] Joseph R. Shoenfield,et al. Degrees of unsolvability , 1959, North-Holland mathematics studies.
[6] Dieter Spreen,et al. On effective topological spaces , 1998, Journal of Symbolic Logic.
[7] Robert I. Soare,et al. Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.
[8] Dieter Spreen,et al. Effective Inseparability in a Topological Setting , 1996, Ann. Pure Appl. Log..
[9] Dieter Spreen,et al. On r.e. inseparability of CPO index sets , 1983, Logic and Machines.
[10] Vasco Brattka. Computable Versions of Baire's Category Theorem , 2001, MFCS.
[11] Oleg V. Kudinov,et al. Positive predicate structures for continuous data , 2015, Math. Struct. Comput. Sci..
[12] Y. Ershov. Model of Partial Continuous Functionals , 1977 .
[13] Douglas A. Cenzer,et al. Index Sets for Pi01 Classes , 1998, Ann. Pure Appl. Log..
[14] K. Hofmann,et al. Continuous Lattices and Domains , 2003 .
[15] Oleg V. Kudinov,et al. Towards Computability over Effectively Enumerable Topological Spaces , 2008, CCA.
[16] Douglas A. Cenzer,et al. Effectively closed sets and enumerations , 2008, Arch. Math. Log..
[17] Ulrich Berger,et al. Total Sets and Objects in Domain Theory , 1993, Ann. Pure Appl. Log..
[18] Peter Hertling,et al. A Banach-Mazur computable but not Markov computable function on the computable real numbers , 2002, Ann. Pure Appl. Log..
[19] Klaus Weihrauch,et al. Computability on Computable Metric Spaces , 1993, Theor. Comput. Sci..
[20] Yuri L. Ershov,et al. Theory of Numberings , 1999, Handbook of Computability Theory.
[21] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[22] MARGARITA KOROVINA,et al. Computable elements and functions in effectively enumerable topological spaces , 2016, Mathematical Structures in Computer Science.
[23] Julia F. Knight,et al. Index sets for classes of high rank structures , 2007, J. Symb. Log..
[24] Oleg V. Kudinov,et al. Index Sets as a Measure of Continuous Constraint Complexity , 2014, Ershov Memorial Conference.
[25] Abbas Edalat,et al. Domains for Computation in Mathematics, Physics and Exact Real Arithmetic , 1997, Bulletin of Symbolic Logic.
[26] Oleg V. Kudinov,et al. The Rice-Shapiro theorem in Computable Topology , 2017, Log. Methods Comput. Sci..
[27] Oleg V. Kudinov,et al. Rice's Theorem in Effectively Enumerable Topological Spaces , 2015, CiE.
[28] Julia F. Knight,et al. Index sets of computable structures , 2006 .
[29] Klaus Weihrauch,et al. On Computable Metrization , 2007, Electron. Notes Theor. Comput. Sci..
[30] Dieter Spreen. On Some Decision Problems in Programming , 1995, Inf. Comput..
[31] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.