The Uniformity Principle for Sigma-definability
暂无分享,去创建一个
[1] Margarita V. Korovina,et al. Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test , 2003, CSL.
[2] Oleg V. Kudinov,et al. Characteristic Properties of Majorant-Computability over the Reals , 1998, CSL.
[3] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.
[4] I︠U︡riĭ Leonidovich Ershov. Definability and Computability , 1996 .
[5] Oleg V. Kudinov,et al. Towards Computability of Higher Type Continuous Data , 2005, CiE.
[6] Oleg V. Kudinov,et al. Semantic Characterisations of Second-Order Computability over the Real Numbers , 2001, CSL.
[7] Oleg V. Kudinov,et al. The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis , 2007, CiE.
[8] Margarita V. Korovina,et al. Gandy's Theorem for Abstract Structures without the Equality Test , 2003, LPAR.
[9] Klaus Weihrauch,et al. Computability on Subsets of Euclidean Space I: Closed and Compact Subsets , 1999, Theor. Comput. Sci..
[10] Jon Barwise,et al. Admissible sets and structures , 1975 .