Subject
General Computer Science,Theoretical Computer Science
Reference36 articles.
1. The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations;Beeson;J. Symbolic Logic,1975
2. The unprovability in intuitionistic formal systems of the continuity of effective operations on the reals;Beeson;J. Symbolic Logic,1976
3. Continuity and comprehension in intuitionistic formal systems;Beeson;Pacific J. Math.,1977
4. Church's thesis, continuity, and set theory;Beeson;J. Symbolic Logic,1984
5. G.S. Ceı̆tin, Algorithmic operators in constructive metric spaces, Trudy Mat. Inst. Steklov 67 (1962) 295–361 (English transl., Amer. Math. Soc. Transl., Ser. 2 64 (1967) 1–80).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献