A blend of methods of recursion theory and topology-Reference-Cited by-同舟云学术

A blend of methods of recursion theory and topology

Published:2003-12 Issue:1-3 Volume:124 Page:141-178
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Kalantari Iraj,Welch Larry

Publisher

Elsevier BV

Subject

Logic

Reference19 articles.

1. Three theorems on constructive functions;Ceı̌tin;Amer. Math. Soc. Transl. Ser.,1972

2. G.S. Ceı̌tin, I.D. Zaslavskiı̌, On singular coverings and properties of constructive functions connected with them, Tr. Mat. Inst. Steklov Moskva 67 (1962) 458–502 (in Russian) (Amer. Math. Soc. Transl. Ser. 2 98 (1971) 41–89 (in English)).

3. D. Cenzer, J.B. Remmel, Π10 classes in mathematics, in: Y. Ersov, S. Goncharov, A. Nerode, J. Remmel (Eds.), Handbook of Recursive Mathematics, Vol. 2, North-Holland Studies in Logic and Foundational Mathematics, Vol. 139, Elsevier, Amsterdam, 1998, pp. 623–821.

4. Recursive Analysis;Goodstein,1961

5. Π10 classes and degrees of theories;Jockusch;Trans. Amer. Math. Soc.,1972

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DEMUTH’S PATH TO RANDOMNESS;The Bulletin of Symbolic Logic;2015-09

2. When series of computable functions with varying domains are computable;Mathematical Logic Quarterly;2013-11

3. Closed choice and a Uniform Low Basis Theorem;Annals of Pure and Applied Logic;2012-08

4. On Turing degrees of points in computable topology;MLQ;2008-09

5. On degree-preserving homeomorphisms between trees in computable topology;Archive for Mathematical Logic;2007-11-27