Computable counter-examples to the Brouwer fixed-point theorem
暂无分享,去创建一个
[1] Stephen G. Simpson,et al. Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations? , 1984, Journal of Symbolic Logic.
[2] Günter Baigger. Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes , 1985, Arch. Math. Log..
[3] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.
[4] Kazuyuki Tanaka,et al. Fixed Point Theory in Weak Second-Order Arithmetic , 1990, Ann. Pure Appl. Log..
[5] R. O. Gandy,et al. COMPUTABILITY IN ANALYSIS AND PHYSICS (Perspectives in Mathematical Logic) , 1991 .
[6] M. Richter,et al. Non-computability of competitive equilibrium , 1999 .
[7] Stephen G. Simpson,et al. Subsystems of second order arithmetic , 1999, Perspectives in mathematical logic.
[8] Joseph S. Miller,et al. Degrees of unsolvability of continuous functions , 2004, Journal of Symbolic Logic.