Complete Bibliography

This is the complete alphabetically sorted bibliography on Constructivity, Computability and Complexity in Analysis with 1357 references, last updated Wed Jul 30 19:02:36 Europe/Berlin 2008

Oliver Aberth. Analysis in the computable number field. Journal of the Association for Computing Machinery, 15:275-299, 1968.
Oliver Aberth. A chain of inclusion relations in computable analysis. Proceedings of the American Mathematical Society, 22:539-548, 1969.
Oliver Aberth. Computable analysis and differential equations. In A. Kino, J. Myhill, and R.E. Vesley, editors, Intuitionism and Proof Theory, Studies in Logic and the Foundations of Mathematics, pages 47-52, Amsterdam, 1970. North-Holland. Proc. of the Summer Conf. at Buffalo N.Y. 1968.
Oliver Aberth. The failure in computable analysis of a classical existence theorem for differential equations. Proceedings of the American Mathematical Society, 30:151-156, 1971.
Oliver Aberth. Computable Analysis. McGraw-Hill, New York, 1980.
Yohji Akama and Shinji Iizuka. Real number representations of graph-directed IFS attractors. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 3-24. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.
Yohji Akama. Limiting partial combinatory algebras. Theoretical Computer Science, 311:199-220, 2004.
Klaus Ambos-Spies, Klaus Weihrauch, and Xizhong Zheng. Weakly computable real numbers. Journal of Complexity, 16(4):676-690, 2000.
Klaus Ambos-Spies. A note on recursively approximable real numbers. Forschungsbericht Mathematische Logik 38, Universität Heidelberg, Heidelberg, 1998.
Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, and Carl H. Smith. On the inductive inference of recursive real-valued functions. Theoretical Computer Science, 219:3-17, 1999.
Margaret Archibald, Vasco Brattka, and Clemens Heuberger. Randomness with respect to the signed-digit representation. Fundamenta Informaticae, 83(1-2):1-19, 2008.
Jeremy Avigad and Ksenija Simic. Fundamental notions of analysis in subsystems of second-order arithmetic. Annals of Pure and Applied Logic, 139:138-184, 2006.
Jeremy Avigad. Weak theories of nonstandard arithmetic and analysis. In Stephen Simpson, editor, Reverse Mathematics 2001, Lecture Notes in Logic, pages 19-46, La Jolla, 2005. Association for Symbolic Logic.
Serikzhan Badaev and Dieter Spreen. A note on partial numberings. Mathematical Logic Quarterly, 51(2):129-136, 2005.
J.C. Baez. Recursivity in quantum mechanics. Trans. Amer. Math. Soc., 280:339-350, 1983.
G. Baigger. Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes. Arch. Math. Logik Grundlag., 25:183-188, 1985.
R. Baire. Sur les fonctions des variables reeles. Annali di matematica pura ed applicata, 3:1-123, 1899.
Stefan Banach and Stanislaw Mazur. Sur les fonctions calculables. Ann. Soc. Pol. de Math., 16:223, 1937.
George Barmpalias and Antonio Montalbán. A cappable almost everywhere dominating computably enumerable degree. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 17-31, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
George Barmpalias, Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber. K-trivial closed sets and continuous functions. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 135-145, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.
George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber. Algorithmic randomness of continuous functions. Archive for Mathematical Logic, 46(7-8):533–--546, 2008.
George Barmpalias. On 0'-computable reals. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.
George Barmpalias. The approximation structure of a computably approximable real. The Journal of Symbolic Logic, 68(3):885-922, 2003.
George Barmpalias. A transfinite hierarchy of reals. Mathematical Logic Quarterly, 49(2):163-172, 2003.
George Barmpalias. Approximation representations for delta ₂ reals. Archive for Mathematical Logic, 43(8):947-964, 2004.
George Barmpalias. Approximation representations for reals and their wtt-degrees. Mathematical Logic Quarterly, 50(4,5):370-380, 2004.
Georgios Barmpalias. Computability and Applications to Analysis. PhD thesis, University of Leeds, School of Mathematics, Leeds, 2004.
George Barmpalias. Random non-cupping revisited. Journal of Complexity, 22(6):850-857, 2006.
M. A. Baroni and D. S. Bridges. Continuity properties of preference relations. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 19-25. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
Marian Alexandru Baroni. Constructive suprema. Journal of Universal Computer Science, 11(12):1865-1877, 2005.
Prashant Batra. Newton's method and the computational complexity of the fundamental theorem of algebra. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 201-218. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
Andrej Bauer and Iztok Kavkler. Implementing real numbers with RZ. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 365-384. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
Andrej Bauer and Alex Simpson. Locally non-compact spaces and continuity principles. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 103-116. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.
Andrej Bauer and Alex Simpson. Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability. Mathematical Logic Quarterly, 50(4,5):351-369, 2004.
Andrej Bauer and Christopher A. Stone. RZ: A tool for bringing constructive and computable mathematics closer to programming practice. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 28-42, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.
Andrej Bauer and Paul Taylor. The Dedekind reals in abstract Stone duality. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 25-64. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.
Andrej Bauer, Martín Hötzel Escardó, and Alex Simpson. Comparing functional paradigms for exact real-number computation. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 488-500, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.
Andrej Bauer, Lars Birkedal, and Dana S. Scott. Equilogical spaces. Theoretical Computer Science, 315:35-59, 2004.
Andrej Bauer. The Realizability Approach to Computable Analysis and Topology. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, 2000.
Andrej Bauer. A relationship between equilogical spaces and type two effectivity. In Stephen Brooks and Michael Mislove, editors, Seventeenth Conference on the Mathematical Foundations of Programming Semantics, volume 45 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2001. Elsevier. MFPS 2001, Aarhus, Denmark May 23-26, 2001.
Andrej Bauer. A relationship between equilogical spaces and type two effectivity. Mathematical Logic Quarterly, 48(Suppl. 1):1-15, 2002.
Verónica Becher and Santiago Figueira. An example of a computable absolutely normal number. Theoretical Computer Science, 270:947-958, 2002.
Verónica Becher and Serge Grigorieff. Recursion and topology on 2^{leq omega} for possibly infinite computations. Theoretical Computer Science, 322(1):85-136, 2004.
Verónica Becher and Serge Grigorieff. Random reals á la Chaitin with or without prefix-freeness. Theoretical Computer Science, 385:193-201, 2007.
Verónica Becher, Santiago Figueira, and Rafael Picchi. Turing’s unpublished algorithm for normal numbers. Theoretical Computer Science, 377(1-3):126-138, 2007.
Benjamín René Callejas Bedregal and Benedito Melo Acióly. Effectively given continuous domains: A computable interval analysis. Electronic Journal on Mathematics of Computation, 0, 1999.
M.J. Beeson. Problematic principles in constructive mathematics. In Logic Colloquium '80, volume 108 of Studies in Logic and the Foundations of Mathematics, pages 11-55, Amsterdam, 1980. North-Holland.
M.J. Beeson. Foundations of Constructive Mathematics. Ergeb. Math. Grenzgeb. Springer, Berlin, 1985.
Michael Beeson. Constructivity, computability, and the continuum. In Giandomenico Sica, editor, Essays on the Foundations of Mathematics and Logic, volume 2 of Advanced Studies in Mathematics and Logic, pages 9-37. Polimetrica, Milano, 2005.
Edwin J. Beggs and John V. Tucker. Can Newtonian systems, bounded in space, time, mass and energy compute all functions? Theoretical Computer Science, 371:4-19, 2007.
V. Benci, C. Bonanno, S. Galatolo, G. Menconi, and M. Virgilio. Dynamical systems and computable information. Discrete and Continuous Dynamical Systems B, 4(4):935-960, 2004.
Josef Berger and Douglas S. Bridges. A bizarre property equivalent to the Pi ⁰₁--fan theorem. Logic Journal of the IGPL, 14:867-871, 2006.
Josef Berger and Douglas S. Bridges. A fan-theoretic equivalent of the antithesis of Specker's theorem. Indag. Math. N.S., 18(2):195-202, 2007.
Josef Berger and Douglas Bridges. The anti-Specker property, a Heine–Borel property. Archive for Mathematical Logic, 46(7-8):583–--592, 2008.
Josef Berger and Hajime Ishihara. Brouwer's fan theorem and unique existence in constructive analysis. Mathematical Logic Quarterly, 51(4):360-364, 2005.
Josef Berger, Douglas S. Bridges, and Peter Schuster. The fan theorem and unique existence of maxima. The Journal of Symbolic Logic, 71(2):713-720, 2006.
Josef Berger. Constructive equivalents of the uniform continuity theorem. Journal of Universal Computer Science, 11(12):1878-1883, 2005.
Josef Berger. Exact calculation of inverse functions. Mathematical Logic Quarterly, 51(2):201-205, 2005.
Josef Berger. The logical strength of the uniform continuity theorem. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 35-39, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.
Yves Bertot. Affine functions and series with co-inductive real numbers. Mathematical Structures in Computer Science, 17:37-63, 2007.
Laurent Bienvenu and Wolfgang Merkle. Effective randomness for computable probability measures. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 117-130, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
I. Binder, Mark Braverman, and M. Yampolsky. On computational complexity of Siegel Julia sets. Comm. Math. Phys., 264(2):317-334, 2006.
Errett Bishop and Douglas S. Bridges. Constructive Analysis, volume 279 of Grundlehren der Mathematischen Wissenschaften. Springer, Berlin, 1985.
E. Bishop and H. Cheng. Constructive Measure Theory. American Mathematical Society, Providence, 1972.
Errett Bishop. Constructive Methods in the Theory of Banach Algebras. In F.T. Birtel, editor, Function Algebras, pages 343-345, Chicago, 1966. Scott-Foresman. Proc. Internat. Sympos. on Function Algebras, Tulane Univ., 1965.
Errett Bishop. Foundations of Constructive Analysis. McGraw-Hill, New York, 1967.
Errett Bishop. A constructive ergodic theorem. J. Math. Mech., 17:631-639, 1967/1968.
Errett Bishop. The constructivization of abstract mathematical analysis. Izdat. Mir, pages 308-313, 1968. Proc. Internat. Congr. Math., Moscow, 1968.
Jens Blanck, Vasco Brattka, and Peter Hertling, editors. Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers.
Jens Blanck, Viggo Stoltenberg-Hansen, and John V. Tucker. Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theoretical Computer Science, 284(2):207-240, 2002.
Jens Blanck. Computability on topological spaces by effective domain representations. PhD thesis, Uppsala University, Department of Mathematics, Uppsala, Sweden, 1997.
Jens Blanck. Domain representability of metric spaces. Annals of Pure and Applied Logic, 83:225-247, 1997.
Jens Blanck. Effective domain representations of H(X), the space of compact subsets. Theoretical Computer Science, 219:19-48, 1999.
Jens Blanck. Domain representations of topological spaces. Theoretical Computer Science, 247:229-255, 2000.
Jens Blanck. Effectivity of regular spaces. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 1-15, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.
Jens Blanck. Exact real arithmetic systems: Results of competition. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 389-393, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.
Jens Blanck. Efficient exact computation of iterated maps. The Journal of Logic and Algebraic Programming, 64:41-59, 2005.
Markus Bläser. Uniform computational complexity of the derivatives of C^ infty -functions. Theoretical Computer Science, 284(2):199-206, 2002.
Hans Boehm and Robert Cartwright. Exact real arithmetic, formulating real numbers as functions. In D. Turner, editor, Research topics in functional programming, pages 43-64. Addison-Wesley, 1990.
Hans-J. Boehm. The constructive reals as a Java library. The Journal of Logic and Algebraic Programming, 64:3-11, 2005.
Paolo Boldi and Sebastiano Vigna. delta -uniform BSS machines. Journal of Complexity, 14(2):234-256, 1998.
Paolo Boldi and Sebastiano Vigna. Equality is a jump. Theoretical Computer Science, 219:49-64, 1999.
Claudio Bonanno, Stefano Galatolo, and Stefano Isola. Recurrence and algorithmic information. Nonlinearity, 17(3):1057-1074, 2004.
Volker Bosserhoff. Computability of solutions of operator equations. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 179-202, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Volker Bosserhoff. Computability of solutions of operator equations. Mathematical Logic Quarterly, 53(4-5):326-344, 2007.
Volker Bosserhoff. The bit-complexity of finding nearly optimal quadrature rules for weighted integration. Journal of Universal Computer Science, 14(6):938-955, 2008.
Volker Bosserhoff. Notions of probabilistic computability on represented spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 137-170. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
Volker Bosserhoff. Notions of probabilistic computability on represented spaces. Journal of Universal Computer Science, 14(6):956-995, 2008.
Olivier Bournez and Emmanuel Hainry. Elementarily computable functions over the real numbers and r-sub-recursive functions. Theoretical Computer Science, 348:130-147, 2005.
Olivier Bournez and Emmanuel Hainry. Recursive analysis characterized as a class of real recursive functions. Fundamenta Mathematicae, 74(4):409-433, 2006.
Olivier Bournez, Manuel L. Campagnolo, Daniel Graça, and Emmanuel S. Hainry. Polynomial differential equations compute all real computable functions on computable compact intervals. Journal of Complexity, 23(3):317-335, 2007.
S.S. Brady and J.B. Remmel. The undecidability of the lattice of r.e. closed subsets of an effective topological space. Annals of Pure and Applied Logic, 35:193-203, 1987.
Vasco Brattka and Ruth Dillhage. Computability of the spectrum of self-adjoint operators. Journal of Universal Computer Science, 11(12):1884-1900, 2005.
Vasco Brattka and Ruth Dillhage. On computable compact operators on Banach spaces. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 365-386, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Vasco Brattka and Ruth Dillhage. On computable compact operators on computable Banach spaces with bases. Mathematical Logic Quarterly, 53(4-5):345-364, 2007.
Vasco Brattka and Guido Gherardi. Borel complexity of topological operations on computable metric spaces. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 83-97, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.
Vasco Brattka and Peter Hertling. Continuity and computability of relations. Informatik Berichte 164, FernUniversität Hagen, Hagen, September 1994.
Vasco Brattka and Peter Hertling. Feasible real random access machines. Journal of Complexity, 14(4):490-526, 1998.
Vasco Brattka and Peter Hertling. Topological properties of real number representations. Theoretical Computer Science, 284(2):241-257, 2002.
Vasco Brattka and Iraj Kalantari. A bibliography of recursive analysis and recursive topology. In Yu. L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel, editors, Handbook of Recursive Mathematics, volume 138 of Studies in Logic and the Foundations of Mathematics, pages 583-620. Elsevier, Amsterdam, 1998. Volume 1, Recursive Model Theory.
Vasco Brattka and Gero Presser. Computability on subsets of metric spaces. Theoretical Computer Science, 305:43-76, 2003.
Vasco Brattka and Matthias Schröder. Computing with sequences, weak topologies and the axiom of choice. In Luke Ong, editor, Computer science logic, volume 3634 of Lecture Notes in Computer Science, pages 462-476. Springer, 2005.
Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65-93, 1999.
Vasco Brattka and Atsushi Yoshikawa. Towards computability of elliptic boundary value problems in variational formulation. Journal of Complexity, 22(6):858-880, 2006.
Vasco Brattka and Martin Ziegler. Computability of linear equations. In Ricardo Baeza-Yates, Ugo Montanari, and Nicola Santoro, editors, Foundations of Information Technology in the Era of Network and Mobile Computing, volume 223 of IFIP International Federation for Information Processing, pages 95-106, Dordrecht, 2002. Kluwer Academic Publishers. 2nd IFIP International Conference on Theoretical Computer Science, Montréal, Canada, August 25-30, 2002.
Vasco Brattka, Peter Hertling, Mariko Yasugi, and Ning Zhong, editors. Selected Papers of the Dagstuhl Seminar on Computability and Complexity in Analysis 2001, volume 48 (Suppl. 1) of Mathematical Logic Quarterly, Weinheim, 2002. Wiley-VCH.
Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors. Computability and Complexity in Analysis, volume 66(1) of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.
Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong. Computability and complexity in analysis. Informatik Berichte 302, FernUniversität in Hagen, Hagen, August 2003. Proccedings, International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.
Vasco Brattka, Peter Hertling, Ker-I Ko, and Ning Zhong, editors. Special Issue Computability and Complexity in Analysis, volume 50 of Mathematical Logic Quarterly, Weinheim, 2004. Wiley-VCH. Selected Papers of the International Conference CCA 2003, held in Cincinnati, Ohio, August 28-30, 2003.
Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors. Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.
Vasco Brattka, Peter Hertling, Ker-I Ko, and Hideki Tsuiki, editors. Computability and Complexity in Analysis, volume 522 of Journal of Complexity, Amsterdam, 2006. Elsevier. Selected Papers of the International Conference CCA 2005, held in Kyoto, Japan, August 25-29, 2005.
Vasco Brattka, Christiane Frougny, and Norbert Müller, editors. Real Numbers, volume 41 of Theoretical Informatics and Applications, Les Ulis, 2007. EDP Sciences. Selected Papers of the 6th conference on Real Numbers and Computers, Dagstuhl, Germany, November 15-17, 2004.
Vasco Brattka, Peter Hertling, and Klaus Weihrauch. A tutorial on computable analysis. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, New Computational Paradigms: Changing Conceptions of What is Computable, pages 425-491. Springer, New York, 2008.
Vasco Brattka, Hajime Ishihara, Matthias Schröder, and Ning Zhong, editors. Computability and Complexity in Analysis, volume 14 of Journal of Universal Computer Science, Graz, 2008. Graz University of Technology. Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy.
Vasco Brattka. Computable selection in analysis. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 125-138. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.
Vasco Brattka. Recursive characterization of computable real-valued functions and relations. Theoretical Computer Science, 162:45-77, 1996.
Vasco Brattka. Order-free recursion on the real numbers. Mathematical Logic Quarterly, 43:216-234, 1997.
Vasco Brattka. Recursive and Computable Operations over Topological Structures. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1998.
Vasco Brattka. Computable invariance. Theoretical Computer Science, 210:3-20, 1999.
Vasco Brattka. A stability theorem for recursive analysis. In Cristian S. Calude and Michael J. Dinneen, editors, Combinatorics, Computation & Logic, Discrete Mathematics and Theoretical Computer Science, pages 144-158, Singapore, 1999. Springer. Proceedings of DMTCS'99 and CATS'99, Auckland, New Zealand, January 1999.
Vasco Brattka. Realistic models of computability on the real numbers. In Atsushi Yoshikawa, editor, Relevance and Feasibility of Mathematical Analysis on the Computer, volume 1169 of Surikaisekikenkyusho Kokyuroku, pages 62-75, Kyoto, 2000. Research Institute for Mathematical Sciences.
Vasco Brattka. Computability of Banach space principles. Informatik Berichte 286, FernUniversität Hagen, Fachbereich Informatik, Hagen, June 2001.
Vasco Brattka. Computable versions of Baire's category theorem. In Jirí Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, volume 2136 of Lecture Notes in Computer Science, pages 224-235, Berlin, 2001. Springer. 26th International Symposium, MFCS 2001, Mariánské Lázne, Czech Republic, August 27-31, 2001.
Vasco Brattka. Computing uniform bounds. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.
Vasco Brattka. Random numbers and an incomplete immune recursive set. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 950-961, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.
Vasco Brattka. Some notes on Fine computability. Journal of Universal Computer Science, 8(3):382-395, 2002.
Vasco Brattka. Computability on asymmetric spaces. Informatik Berichte 305, FernUniversität in Hagen, Fachbereich Informatik, Hagen, December 2003.
Vasco Brattka. Computability over topological structures. In S. Barry Cooper and Sergey S. Goncharov, editors, Computability and Models, pages 93-136. Kluwer Academic Publishers, New York, 2003.
Vasco Brattka. Effective representations of the space of linear bounded operators. Applied General Topology, 4(1):115-131, 2003.
Vasco Brattka. The emperor's new recursiveness: The epigraph of the exponential function in two models of computability. In Masami Ito and Teruo Imaoka, editors, Words, Languages & Combinatorics III, pages 63-72, Singapore, 2003. World Scientific Publishing. ICWLC 2000, Kyoto, Japan, March 14-18, 2000.
Vasco Brattka. The inversion problem for computable linear operators. In Helmut Alt and Michel Habib, editors, STACS 2003, volume 2607 of Lecture Notes in Computer Science, pages 391-402, Berlin, 2003. Springer. 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27-March 1, 2003.
Vasco Brattka. Plottable real number functions and the computable graph theorem. Informatik Berichte 300, FernUniversität in Hagen, Fachbereich Informatik, Hagen, July 2003.
Vasco Brattka. Recursive quasi-metric spaces. Theoretical Computer Science, 305:17-42, 2003.
Vasco Brattka. Du 13-ième problème de Hilbert à la théorie des réseaux de neurones : aspects constructifs du théorème de superposition de Kolmogorov. In Éric Charpentier, Annick Lesne, and Nikolai Nikolski, editors, L'héritage de Kolmogorov en mathématiques, pages 241-268. Éditions Belin, Paris, 2004.
Vasco Brattka. Computability on non-separable Banach spaces and Landau's theorem. In Laura Crosilla and Peter Schuster, editors, From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics, pages 316-333. Oxford University Press, 2005.
Vasco Brattka. Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly, 51(1):19-44, 2005.
Vasco Brattka. On the Borel complexity of Hahn-Banach extensions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 3-16, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.
Vasco Brattka. Computable versions of the uniform boundedness theorem. In Z. Chatzidakis, P. Koepke, and W. Pohlers, editors, Logic Colloquium 2002, volume 27 of Lecture Notes in Logic, pages 130-151, Urbana, 2006. Association for Symbolic Logic.
Vasco Brattka. From Hilbert's 13th Problem to the theory of neural networks: constructive aspects of Kolmogorov's Superposition Theorem. In Éric Charpentier, Annick Lesne, and Nikolai Nikolski, editors, Kolmogorov's Heritage in Mathematics, pages 253-280. Springer, Berlin, 2007.
Vasco Brattka. Borel complexity and computability of the Hahn-Banach Theorem. Archive for Mathematical Logic, 46(7-8):547-564, 2008.
Vasco Brattka. Plottable real number functions and the computable graph theorem. SIAM Journal on Computing, 38(1):303-328, 2008.
Mark Braverman and Stephen Cook. Computing over the reals: Foundations for scientific computing. Notices of the AMS, 53(3):318-329, 2006.
Mark Braverman and M. Yampolsky. Non-computable Julia sets. Journal of the American Mathematical Society, 19(3):551-578, 2006.
Mark Braverman. Hyperbolic Julia sets are poly-time computable. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 17-30, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.
Mark Braverman. Parabolic Julia sets are polynomial time computable. Nonlinearity, 19(6):1383-1401, 2006.
Josef M. Breutzmann, David W. Juedes, and Jack H. Lutz. Baire category and nowhere differentiability for feasible real functions. In Peter Eades and Tadao Takaoka, editors, Algorithms and Computation, volume 2223 of Lecture Notes in Computer Science, pages 219-230, Berlin, 2001. Springer. 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001.
Josef M. Breutzmann, David W. Juedes, and Jack H. Lutz. Baire category and nowhere differentiability for feasible real functions. Mathematical Logic Quarterly, 50(4,5):460-472, 2004.
Douglas Bridges and Luminita Dediu. Paradise lost, or paradise regained? Bulletin of the European Association for Theoretical Computer Science, 63:141-155, 1997.
Douglas Bridges and Luminita Dediu. Weak continuity properties in constructive analysis. Logic Journal of the IGPL. Interest Group in Pure and Applied Logics, 7(3):277-281, 1999.
Douglas Bridges and Luminita Dediu. Weak-operator continuity and the existence of adjoints. Mathematical Logic Quarterly, 45(2):203-206, 1999.
Douglas Bridges and Luminita Dediu. The weak-operator sequential continuity of left multiplication. Indagationes Mathematicae, 11(1):39-42, 2000.
Douglas Bridges and Osvald Demuth. On the Lebesgue measurability of continuous functions in constructive analysis. BAMS, 24(2):259-276, 1991.
Douglas Bridges and Hannes Diener. A constructive treatment of Urysohn's Lemma in an apartness space. Mathematical Logic Quarterly, 52(5):464-469, 2006.
D. S. Bridges and N. F. Dudley Ward. Constructing ultraweakly continuous functionals on B(H). Proceedings of the American Mathematical Society, 126(11):3347-3353, 1998.
Douglas Bridges and Robin Havea. A constructive analysis of a proof that the numerical range is convex. London Math. Soc. Journal of Mathematics and Computation, 3:191-206, 2000.
Douglas Bridges and Robin Havea. A constructive version of the spectral mapping theorem. Mathematical Logic Quarterly, 47(3):299-304, 2001.
Douglas S. Bridges and Robin Havea. Powers of a Hermitian element. New Zealand J. Math., 36:1-10, 2007.
Douglas Bridges and Hajime Ishihara. Linear mappings are fairly well-behaved. Archiv der Mathematik. Archives of Mathematics. Archives Mathématiques, 54(6):558-562, 1990.
Douglas Bridges and Hajime Ishihara. Locating the range of an operator on a Hilbert space. The Bulletin of the London Mathematical Society, 24(6):599-605, 1992.
Douglas Bridges and Hajime Ishihara. Absolute continuity and the uniqueness of the constructive functional calculus. Mathematical Logic Quarterly, 40(4):519-527, 1994.
Douglas S. Bridges and Hajime Ishihara. Complements of intersections in constructive mathematics. Mathematical Logic Quarterly, 40(1):35-43, 1994.
Douglas S. Bridges and Hajime Ishihara. Erratum: ``Complements of intersections in constructive mathematics''. Mathematical Logic Quarterly, 40(4):570, 1994.
Douglas Bridges and Hajime Ishihara. Spectra of selfadjoint operators in constructive analysis. Indagationes Mathematicae, 7(1):11-35, 1996.
Douglas Bridges and Hajime Ishihara. A definite constructive open mapping theorem? Mathematical Logic Quarterly, 44(4):545-552, 1998.
Douglas Bridges and Hajime Ishihara. Constructive closed range and open mapping theorems. Indagationes Mathematicae, 11(4):509-516, 2001.
Douglas Bridges and Hajime Ishihara. Constructive unbounded operators. In Peter Schuster, Ulrich Berger, and Horst Osswald, editors, Reuniting the antipodes--constructive and nonstandard views of the continuum (Venice, 1999), volume 306 of Synthese Library, pages 25-37, Dordrecht, 2001. Kluwer Acad. Publ.
Douglas Bridges and Ayan Mahalanobis. Sequential continuity of functions in constructive analysis. Mathematical Logic Quarterly, 46(1):139-143, 2000.
Douglas Bridges and Ayan Mahalanobis. Bounded variation implies regulated: a constructive proof. The Journal of Symbolic Logic, 66(4):1695-1700, 2001.
Douglas Bridges and Ayan Mahalanobis. Increasing, nondecreasing, and virtually continuous functions. Journal of Automata, Languages and Combinatorics, 6(2):139-143, 2001.
D.S. Bridges and R. Mines. What is constructive mathematics? The Mathematical Intelligencer, 6(4):32-38, 1984.
Douglas Bridges and Ray Mines. Sequentially continuous linear mappings in constructive analysis. The Journal of Symbolic Logic, 63(2):579-583, 1998.
Douglas Bridges and Gabriela Popa. Exact, continuous boundary crossings out of convex sets in rⁿ. The Quarterly Journal of Mathematics, 54(4):391-398, 2003.
Douglas Bridges and Steve Reeves. Constructive mathematics in theory and programming practice. Philosophia Mathematica. Philosophy of Mathematics, its Learning, and its Application. Series III, 7(1):65-104, 1999. Mathematical proof.
Douglas Bridges and Fred Richman. Varieties of Constructive Mathematics, volume 97 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1987.
Douglas S. Bridges and Fred Richman. A recursive counterexample to Debreu's theorem on the existence of a utility function. Mathematical Social Sciences, 21(2):179-182, 1991.
Douglas Bridges and Peter Schuster. A simple constructive proof of Kronecker's density theorem. Elemente der Mathematik, 61:152-154, 2006.
Douglas Bridges and Karl Svozil. Constructive mathematics and quantum physics. J. Theor. Physics, 39:501-513, 2000.
Douglas Bridges and Luminita Vîta. Constructing extensions of ultraweakly continuous linear functionals. J. Functional Analysis, 178(2):421-434, 2000.
Douglas Bridges and Luminita Vîta. Characterising near continuity constructively. Mathematical Logic Quarterly, 47(4):535-538, 2001.
Douglas Bridges and Luminita Vîta. Cauchy nets in the constructive theory of apartness spaces. Scientiae Mathematicae Japonicae, 56(1):123-132, 2002.
Douglas Bridges and Luminita Vîta. Apartness spaces as a framework for constructive topology. Annals of Pure and Applied Logic, 119(1-3):61-83, 2003.
Douglas Bridges and Luminita Vîta. Cauchy nets in uniform apartness spaces. Revue Roumaine de Mathématiques Pures et Appliquées, 48(5-6):467-474, 2003.
Douglas Bridges and Luminita Vîta. A proof-technique in uniform space theory. The Journal of Symbolic Logic, 68(3):795-802, 2003.
Douglas Bridges and Luminita Vîta. Separatedness in constructive topology. Documenta Mathematica, 8:567-576, 2003.
Douglas Bridges and Luminita Vîta. Strong and uniform continuity--the uniform space case. LMS Journal of Computation and Mathematics, 6:326-334, 2003.
Douglas Bridges and Luminita Vîta. Corrigendum to: ``A proof-technique in uniform space theory''. The Journal of Symbolic Logic, 69(1):328, 2004.
Douglas Bridges and Luminita Vîta. An extension theorem for ultraweakly continuous linear functionals on b(x,y). In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 77-89. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.
Douglas Bridges and Luminita Vîta. A general constructive proof technique. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 31-43, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.
Douglas Bridges and Luminita Vîta. Proximal connectedness. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 91-101. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.
Douglas Bridges and Luminita Vîta. Pre-apartness structures on spaces of functions. Journal of Complexity, 22(6):881-893, 2006.
Douglas Bridges and Luminita Vîta. Techniques of Constructive Analysis. Springer, New York, 2006.
Douglas Bridges and Yuchuan Wang. Constructing cutoff functions. New Zealand Journal of Mathematics, 26(1):25-30, 1997.
Douglas Bridges and Yuchuan Wang. Constructive aspects of the Dirichlet problem. Journal of Universal Computer Science, 3(11):1148-1161 (electronic), 1997. Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science (Auckland, 1997).
Douglas Bridges and Yuchuan Wang. Constructing best approximations on a Jordan curve. Journal of Approximation Theory, 94(2):222-234, 1998.
Douglas Bridges and Yuchuan Wang. Constructive weak solutions of the Dirichlet problem. The Journal of the London Mathematical Society. Second Series, 57(3):655-667, 1998.
Douglas Bridges and Yuchuan Wang. Weak solutions of the Dirichlet problem and the locatedness of H sp 1 sb 0( omega ). New Zealand Journal of Mathematics, 27(1):1-5, 1998.
Douglas S. Bridges and Nicholas Dudley Ward. Kernels of seminorms in constructive analysis. Theoretical Computer Science, 284(2):259-267, 2002.
Douglas Bridges, Allan Calder, William Julian, Ray Mines, and Fred Richman. Bounded linear mappings of finite rank. Journal of Functional Analysis, 43(2):143-148, 1981.
Douglas Bridges, Allan Calder, William Julian, Ray Mines, and Fred Richman. Locating metric complements in Rⁿ. In F. Richman, editor, Constructive Mathematics, volume 873 of Lecture Notes in Mathematics, pages 241-249, 1981. Proc. New Mexico State Univ. Conf., Aug. 11-15, 1980, Las Cruces, NM.
Douglas Bridges, Allan Calder, William Julian, Ray Mines, and Fred Richman. Picard's theorem. Trans. Amer. Math. Soc., 269(2):513-520, 1982.
Douglas Bridges, William Julian, and Ray Mines. A constructive treatment of open and unopen mapping theorems. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 35(1):29-43, 1989.
D. S. Bridges, F. Richman, W. H. Julian, and R. Mines. Extensions and fixed points of contractive maps in r sp n. Journal of Mathematical Analysis and Applications, 165(2):438-456, 1992.
D.S. Bridges, W.H. Julian, F. Richman, and R. Mines. Extensions and fixed points of contractive maps in Rⁿ. J. Math. Anal. Appl., 165:438-456, 1992.
Douglas Bridges, Fred Richman, and Wang Yuchuan. Sets, complements and boundaries. Indagationes Mathematicae, 7(4):425-445, 1996.
D. Bridges, C. Calude, B. Pavlov, and D. Stefanescu. The constructive implicit function theorem and applications in mechanics. Chaos, Solitons and Fractals, 10(6):927-934, 1999.
Douglas Bridges, Hajime Ishihara, and Peter Schuster. Sequential compactness in constructive analysis. Österr. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. II., 208:159-163, 1999.
Douglas Bridges, Fred Richman, and Peter Schuster. Adjoints, absolute values, and polar decompositions. J. Operator Theory, 44(2):243-254, 2000.
Douglas Bridges, Fred Richman, and Peter Schuster. Linear independence without choice. Annals of Pure and Applied Logic, 101(1):95-102, 2000.
Douglas Bridges, Fred Richman, and Peter Schuster. A weak countable choice principle. Proceedings of the American Mathematical Society, 128(9):2749-2752, 2000.
Douglas Bridges, Hajime Ishihara, and Peter Schuster. Compactness and continuity, constructively revisited. In Julian Bradfield, editor, Computer science logic, volume 2471 of Lecture Notes in Computer Science, pages 89-102. Springer, 2002.
Douglas Bridges, Peter Schuster, and Luminita Vîta. Apartness, topology, and uniformity: a constructive view. Mathematical Logic Quarterly, 48(Suppl. 1):16-28, 2002.
Douglas Bridges, Hajime Ishihara, and Bas Spitters. Locating the range of an operator with an adjoint. Indagationes Mathematicae, 13(4):433-440, 2003.
Douglas Bridges, Dirk van Dalen, and Hajime Ishihara. Ishihara's proof technique in constructive analysis. Indagationes Mathematicae, 14(2):163-168, 2003.
Douglas Bridges, Hajime Ishihara, and Luminita Vîta. Computing infima on convex sets, with applications in Hilbert spaces. Proceedings of the American Mathematical Society, 132(9):2723-2732, 2004.
Douglas Bridges, Ray Mines, Fred Richman, and Peter Schuster. The polydisk Nullstellensatz. Proceedings of the American Mathematical Society, 132(7):2133-2140, 2004.
Douglas Bridges, Robin Havea, and Peter Schuster. Constructive Banach algebra theory and the Nullstellensatz. Publ. Math. Debrecen, 69(1,2):171-184, 2006.
Douglas Bridges, Robin Havea, and Peter Schuster. Ideals in constructive Banach algebra theory. Journal of Complexity, 22(6):729-737, 2006.
Douglas Bridges, Hajime Ishihara, and Luminita Vîta. A new constructive version of Baire's theorem. Hokkaido Math. Journal, 35(1):107-118, 2006.
Douglas Bridges, Hajime Ishihara, Ray Mines, Fred Richman, Peter M. Schuster, and Luminita Vîta. Almost locatedness in uniform spaces. Czechoslovak Math. J., 57(1):1-12, 2007.
Douglas S. Bridges. Some notes on continuity in constructive analysis. Bull. London Math. Soc., 8(2):179-182, 1976.
Douglas S. Bridges. A constructive look at orthonormal bases in Hilbert space. Amer. Math. Monthly, 84(3):189-191, 1977.
Douglas S. Bridges. The constructive Radon-Nikodym theorem. Pacific J. Math., 70(1):51-65, 1977.
D. S. Bridges. More on the connectivity of convex sets. Proceedings of the American Mathematical Society, 68(2):214-216, 1978.
Douglas S. Bridges. A note on Morse's lambda-notation in set theory. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24(2):113-114, 1978.
Douglas S. Bridges. On continuous mappings between locally compact metric spaces. The Bulletin of the London Mathematical Society, 10(2):201-208, 1978.
Douglas S. Bridges. On the connectivity of convex sets. The Bulletin of the London Mathematical Society, 10(1):86-90, 1978.
Douglas S. Bridges. On weak operator compactness of the unit ball of L(H). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24(6):493-494, 1978.
Douglas S. Bridges. Connectivity properties of metric spaces. Pacific Journal of Mathematics, 80(2):325-331, 1979.
Douglas S. Bridges. Constructive Functional Analysis. Pitman, London, 1979.
Douglas S. Bridges. A criterion for compactness in metric spaces? Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25(2):97-98, 1979.
Douglas S. Bridges. Geometric intuition and elementary constructive analysis. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25(6):521-523, 1979.
Douglas S. Bridges. On the constructive convergence of series of independent functions. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25(1):93-96, 1979.
Douglas S. Bridges. A constructive development of Chebyshev approximation theory. Journal of Approximation Theory, 30(2):99-120, 1980.
Douglas S. Bridges. On the foundations of best-approximation theory. Journal of Approximation Theory, 28(3):273-292, 1980.
Douglas S. Bridges. A constructive analysis of the Remes algorithm. Journal of Approximation Theory, 32(4):257-270, 1981.
Douglas S. Bridges. A constructive look at positive linear functionals on l(H). Pacific Journal of Mathematics, 95(1):11-25, 1981.
Douglas S. Bridges. A constructive proximinality property of finite-dimensional linear subspaces. The Rocky Mountain Journal of Mathematics, 11(4):491-497, 1981.
Douglas S. Bridges. Correction to: ``On the isolation of zeroes of an analytic function'' [Pacific J. Math. 96 (1981), no. 1, 13-22; MR 82k:03095]. Pacific Journal of Mathematics, 97(2):487-488, 1981.
Douglas S. Bridges. On Montel's proof of the great Picard theorem. The American Mathematical Monthly, 88(1):45-47, 1981.
Douglas S. Bridges. On the isolation of zeroes of an analytic function. Pacific Journal of Mathematics, 96(1):13-22, 1981.
Douglas S. Bridges. Towards a constructive foundation for quantum mechanics. In F. Richman, editor, Constructive Mathematics, volume 873 of Lecture Notes in Mathematics, pages 260-273, 1981. Proc. New Mexico State Univ. Conf., Aug. 11-15, 1980, Las Cruces, NM.
Douglas S. Bridges. Lipschitz constants and moduli of continuity for the Chebyshev projection. Proceedings of the American Mathematical Society, 85(4):557-561, 1982.
Douglas S. Bridges. Preference and utility: a constructive development. Journal of Mathematical Economics, 9(1-2):165-185, 1982.
Douglas S. Bridges. Recent progress in constructive approximation theory. In The L. E. J. Brouwer Centenary Symposium (Noordwijkerhout, 1981), pages 41-50. North-Holland, Amsterdam, 1982.
Douglas S. Bridges. Numerical representation of intransitive preferences on a countable set. Journal of Economic Theory, 30(1):213-217, 1983.
Douglas S. Bridges. A numerical representation of preferences with intransitive indifference. Journal of Mathematical Economics, 11(1):25-42, 1983.
Douglas S. Bridges. Operator ranges, integrable sets, and the functional calculus. Houston Journal of Mathematics, 11(1):31-44, 1985.
Douglas S. Bridges. Representing interval orders by a single real-valued function. Journal of Economic Theory, 36(1):149-155, 1985.
Douglas S. Bridges. Numerical representation of interval orders on a topological space. Journal of Economic Theory, 38(1):160-166, 1986.
Douglas S. Bridges. A constructive Morse theory of sets. In Mathematical logic and its applications (Druzhba, 1986), pages 61-79. Plenum, New York, 1987.
Douglas S. Bridges. The Euclidean distance construction of order homomorphisms. Mathematical Social Sciences, 15(2):179-188, 1988.
Douglas S. Bridges. Locatedness, convexity, and lebesque measurability. Quart. J. Math. Oxford Ser. 2, 39:411-421, 1988.
Douglas S. Bridges. Approximate interpolation by functions in a Haar space. Journal of Approximation Theory, 57(1):35-39, 1989.
Douglas S. Bridges. The constructive theory of preference relations on a locally compact space. Indagationes Mathematicae, 51(2):141-165, 1989.
Douglas S. Bridges. A general constructive intermediate value theorem. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 35:433-435, 1989.
Douglas S. Bridges. Order isomorphisms--a constructive measure-theoretic view. In Mathematical logic, pages 243-255. Plenum, New York, 1990.
Douglas S. Bridges. Preference, indifference, and Markov's principle. Mathematical Social Sciences, 20(2):131-145, 1990.
Douglas S. Bridges. The constructive inequivalence of various notions of preference ordering. Mathematical Social Sciences, 21(2):169-176, 1991.
Douglas S. Bridges. Constructive notions of strict convexity. Mathematical Logic Quarterly, 39(3):295-300, 1993.
Douglas S. Bridges. Sequential, pointwise, and uniform continuity: a constructive note. Mathematical Logic Quarterly, 39(1):55-61, 1993.
Douglas S. Bridges. A constructive look at the real number line. In Real numbers, generalizations of the reals, and theories of continua, pages 29-92. Kluwer Acad. Publ., Dordrecht, 1994.
Douglas S. Bridges. The constructive theory of preference relations on a locally compact space. II. Mathematical Social Sciences, 27(1):1-9, 1994.
Douglas S. Bridges. Constructive mathematics and unbounded operations. J. Philos. Logic, 24(5):549-561, 1995.
Douglas S. Bridges. Bishop's principle. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 17-20. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.
Douglas S. Bridges. Constructive truth in practice. In Truth in mathematics (Mussomeli, 1995), pages 53-69. Oxford Univ. Press, New York, 1998.
Douglas S. Bridges. Can constructive mathematics be applied in physics? Journal of Philosophical Logic, 28(5):439-453, 1999.
Douglas S. Bridges. Constructive mathematics: a foundation for computable analysis. Theoretical Computer Science, 219:95-109, 1999.
Douglas S. Bridges. Constructive methods in mathematical economics. In Gerhard Herden, Norbert Knoche, Christian Seidl, and Walter Trockel, editors, Mathematical utility theory (Essen, 1997), volume Supp. 8 of Journal of Economy, pages 1-21. Springer, Vienna, 1999.
Douglas Bridges. A constructive look at functions of bounded variation. Bull. London Math. Soc., 32(3):316-324, 2000.
Douglas Bridges. Constructive methods in Banach algebra theory. Mathematica Japonica, 52(1):145-161, 2000.
Douglas Bridges. Converses of Bishop's lemma on located sets. Indagationes Mathematicae, 11(1):31-38, 2000.
Douglas Bridges. Dini's theorem: A constructive case study. In C.S. Calude, M.J. Dinneen, and S. Sburlan, editors, Combinatorics, Computability and Logic, Discrete Mathematics and Theoretical Computer Science, pages 69-80, London, 2001. Springer. Proceedings of DMTCS 2001.
Douglas Bridges. Prime and maximal ideals in constructive ring theory. Communications in Algebra, 29(7):2787-2803, 2001.
Douglas Bridges. Reality and virtual reality in mathematics. Bulletin of the European Association for Theoretical Computer Science, 78:221-230, 2002.
Douglas S. Bridges. First steps in constructive game theory. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 3-9. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.
Douglas S. Bridges. Constructive complements of unions of two closed sets. Mathematical Logic Quarterly, 50(3):293-294, 2004.
Douglas S. Bridges. Constructivity in mathematics. Cubo, 6(1):209-258, 2004.
Douglas S. Bridges. First steps in constructive game theory. Mathematical Logic Quarterly, 50(4,5):501-506, 2004.
Douglas S. Bridges. Church's thesis and Bishop's constructivism. In Adam Olszewski, editor, Church's Thesis After 70 Years, pages 58-65. Ontos, Berlin, 2006.
Douglas S. Bridges. Colocatedness and Lebesgue integrability. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 98-104, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.
Douglas S. Bridges. Constructing local optima on a compact interval. Archive for Mathematical Logic, 46:149-154, 2007.
Douglas S. Bridges. Philosophy of mathematics: 5 questions. In Vincent F. Hendricks and Hannes Leitgeb, editors, Philosophy of mathematics: 5 questions, pages 45-49. Automatic Press/VIP, New York, London, 2007.
Douglas S. Bridges. Product a-frames and proximity. Mathematical Logic Quarterly, 54(1):12-25, 2008.
Douglas S. Bridges. Uniform continuity properties of preference relations. Notre Dame Journal of Formal Logic, 49(1):97-106, 2008.
Eyvind Briseid. A rate of convergence for asymptotic contractions. J. Math. Anal. Appl., 330:364-376, 2007.
Eyvind Briseid. Some results on Kirk's asymptotic contractions. Fixed Point Theory, 8:17-27, 2007.
Paul Brodhead and Douglas Cenzer. Effectively closed sets and enumerations. Archive for Mathematical Logic, 46(7-8):565–--582, 2008.
Paul Brodhead, Douglas Cenzer, and Seyyed Dashti. Random closed sets. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 55-64, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.
Paul Brodhead, Douglas Cenzer, and Jeffrey B. Remmel. Random continuous functions. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Paul Brodhead. Enumerations of Pi ⁰₁ classes: acceptability and decidable classes. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 289-301, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
L.E.J. Brouwer. Intuitionistischer Beweis des Jordanschen Kurvensatzes. Koninklijke Nederl. Akad. Wentensch, Proc., 28:503-508, 1925. translated in: A. Heyting (ed.), Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, North-Holland, Amsterdam, 1975, 315-320.
L.E.J. Brouwer. An intuitionist correction of the fixed-point theorem on the sphere. Proc. Roy. Soc. London, Ser. A, 213:1-2, 1952.
L.E.J. Brouwer. Points and spaces. Canad. Journ. Math., 6:1-17, 1954.
L.E.J. Brouwer. Collected Works, Vol. 1, Philosophy and Foundations of Mathematics. North-Holland, Amsterdam, 1975. Heyting, A. (ed).
L.E.J. Brouwer. Fixed cores which cannot be found, though they are claimed to exist by classical theorems. In A. Heyting, editor, Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, pages 516-518, Amsterdam, 1975. North-Holland.
L.E.J. Brouwer. The unreliability of logical principles. In A. Heyting, editor, Collected Works, Vol. 1, Philosophy and Foundations of Mathematics, pages 107-111, Amsterdam, 1975. North-Holland.
L.E.J. Brouwer. Collected Works, Vol. 2, Geometry, Analysis, Topology and Mechanics. North-Holland, Amsterdam, 1976. Freudenthal, H. (ed).
L.E.J. Brouwer. Brouwer's Cambridge Lectures on Intuitionism. Cambridge Univ. Press, 1981. van Dalen, D. (ed).
Ashley Burrows and David Lester. Exact arithmetic and the Korteweg-de Vries equation. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 23-41. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.
Dmitry Buy. Some remarks about fixpoint theorems. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 43-52. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.
Benoit Cagnard and Pierre Simonnet. Automata, Borel functions and real numbers in Pisot base. Theoretical Informatics and Applications, 41(1):27-44, 2007.
J. Caldwell and Marian Boykan Pour-El. On a simple definition of computable functions of a real variable - with applications to functions of a complex variable. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:1-19, 1975.
Cristian S. Calude and Peter Hertling. Computable approximations of reals: An information-theoretic analysis. Fundamenta Informaticae, 33(2):105-120, 1998.
Cristian Calude and Helmut Jürgensen. Randomness as an invariant for number representations. In H. Maurer, J. Karhumäki, and G. Rozenberg, editors, Results and Trends in Theoretical Computer Science, pages 44-66, Berlin, 1994. Springer.
Cristian S. Calude and Ludwig Staiger. Generalisations of disjunctive sequences. Mathematical Logic Quarterly, 51(2):120-128, 2005.
Cristian S. Calude, Peter Hertling, and Bakhadyr Khoussainov. Do the zeros of Riemann's Zeta-function form a random sequence? Bulletin of the European Association for Theoretical Computer Science, 62:199-207, 1997.
Cristian S. Calude, Peter Hertling, Bakhadyr Khoussainov, and Yongge Wang. Recursively enumerable reals and Chaitin omega numbers. In Michel et al. Morvan, editor, STACS'98, volume 1373 of Lecture Notes in Computer Science, pages 596-606, Berlin, 1998. Springer. 15th Annual Symposium on Theoretical Aspects of Computer Science. Paris, France, February 25-27, 1998.
C. S. Calude, R. Coles, P. H. Hertling, and B. Khoussainov. Degree theoretic aspects of computably enumerable reals. In S. B. Cooper and J. K. Truss, editors, Models and Computability, volume 259 of London Math. Society Lecture Note Series, pages 23-39, Cambridge, 1999. Cambridge University Press. Invited Papers from Logic Colloquium 1997, Leeds.
Cristian S. Calude, Peter H. Hertling, Bakhadyr Khoussainov, and Yongge Wang. Recursively enumerable reals and Chaitin omega numbers. Theoretical Computer Science, 255:125-149, 2001.
C.S. Calude, P. Hertling, H. Jürgensen, and K. Weihrauch. Randomness on full shift spaces. Chaos, Solitons & Fractals, 12(3):491-503, 2001.
Cristian S. Calude. Chaitin omega numbers, Solovay machines, and Gödel incompleteness. Theoretical Computer Science, 284(2):269-277, 2002.
Cristian S. Calude. A characterization of c.e. random reals. Theoretical Computer Science, 271:3-14, 2002.
Manuel Lameiras Campagnolo and Cristopher Moore. Upper and lower bounds on continuous-time computation. In I. Antoniou, C.S. Calude, and M.J. Dinneen, editors, Unconventional Models of Computation, UMC2'K, Discrete Mathematics and Theoretical Computer Science, pages 135-153, London, 2001. Springer. Second International Conference, UMC 2000, Brussels, Belgium.
Manuel L. Campagnolo and Kerry Ojakian. The methods of approximation and lifting in real computation. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 387-423, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Manuel L. Campagnolo and Kerry Ojakian. The elementary computable functions over the real numbers: applying two new techniques. Archive for Mathematical Logic, 46(7-8):593–--627, 2008.
Manuel Lameiras Campagnolo, Cristopher Moore, and José Félix Costa. Iteration, inequalities, and differentiability in analog computers. Journal of Complexity, 16(4):642-660, 2001.
Manuel Lameiras Campagnolo, Cristopher Moore, and José Félix Costa. An analog characterization of the Grzegorczyk hierarchy. Journal of Complexity, 18(4):977-1000, 2002.
Manuel Lameiras Campagnolo. Computational Complexity of Real Valued Recursive Functions and Analog Circuits. PhD thesis, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisbon, 2001.
Manuel Lameiras Campagnolo. The complexity of real recursive functions. In C.S. Calude, M.J. Dinneen, and F. Peper, editors, Unconventional Models of Computation, volume 2509 of Lecture Notes in Computer Science, pages 1-14, Berlin, 2002. Springer. Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002.
G.S. Ceitin and I.D. Zaslavskii. Singular coverings and properties of constructive functions connected with them. Tr. Mat. Inst. Steklov, 67:458-502, 1962. (Russian).
G.S. Ceitin and I.D. Zaslavskii. A criterion of the rectifiability of constructive plane curves. Izv. Akad Nauk Armjan. SSR Ser. Mat., 5:434-440, 1970. (Russian).
G.S. Ceitin and I.D. Zaslavskii. Yet another constructive variant of the Cauchy theorem. Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI), 20:36-39,282-283, 1971. (Russian).
G.S. Ceitin, Zaslavskii, and Sanin N.A. Peculiarities of constructive mathematical analysis. In Proc. Internat. Congr. Math., pages 253-261, Moscow, 1968. Mir. (Moscow, 1966, in Russian).
G.S. Ceitin. On a theorem of Cauchy in constructive analysis. Uspehi Mat. Nauk, 10:207-209, 1955. (in Russian).
G.S. Ceitin. Uniform recursiveness of algorithmic operators on general recursive functions and a canonical representation for constructive functions of a real argument. In Proc. Third All-Union Math. Congr., Moscow 1956, volume 1, pages 188-189, Moscow, 1956. Izdat. Akad. Nauk SSSR. (in Russian).
G.S. Ceitin. Algorithmic operators in constructive complete separable metric spaces. Doklady Akademii Nauk, 128:49-52, 1959. (in Russian).
G.S. Ceitin. Algorithmic operators in constructive metric spaces. Tr. Mat. Inst. Steklov, 67:295-361, 1962. (in Russian, English trans. in AMS Trans. 64, 1967).
G.S. Ceitin. Mean value theorems in constructive analysis. Tr. Mat. Inst. Steklov, 67:362-384, 1962. (in Russian, English trans. in AMS Trans. 98, 1971).
G.S. Ceitin. Three theorems on constructive functions. Tr. Mat. Inst. Steklov, 72:537-543, 1964. (in Russian, English trans. in AMS Trans. 100, 1972).
G.S. Ceitin. On upper bounds of recursively enumerable sets of constructive real numbers. Tr. Mat. Inst. Steklov, 113:102-172, 1970. (in Russian).
Douglas Cenzer and Peter G. Hinman. Medvedev degrees of generalized r.e. separating classes. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 203-223, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Douglas Cenzer and Jeffrey B. Remmel. Index sets in computable analysis. Theoretical Computer Science, 219:111-150, 1999.
Douglas Cenzer and Jeffrey B. Remmel. Effectively closed sets and graphs of computable real functions. Theoretical Computer Science, 284(2):279-318, 2002.
Douglas Cenzer and Jeffrey B. Remmel. Index sets for computable real functions. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 164-182. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.
Douglas Cenzer and Jeffrey B. Remmel. Index sets for omega --languages. Mathematical Logic Quarterly, 49(1):22-33, 2003.
Douglas Cenzer and Jeffrey B. Remmel. Index sets for computable differential equations. Mathematical Logic Quarterly, 50(4,5):329-344, 2004.
Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors. Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Douglas Cenzer, S. Ali Dashti, and Jonathan L. F. King. Effective symbolic dynamics. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 89-99. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
Douglas Cenzer. Effective real dynamics. In John N. Crossley, Jefferey B. Remmel, Richard A. Shore, and Moss E. Sweedler, editors, Logical Methods in Honor of Anil Nerode's Sixtieth Birthday, volume 12 of Progress in Computer Science and Applied Logic, pages 162-177, Boston, 1993. Birkhäuser.
Thomas Chadzelek and Günter Hotz. Analytic machines. Theoretical Computer Science, 219:151-167, 1999.
Thomas Chadzelek. Analytische Maschinen. PhD thesis, Technische Fakultät der Universität des Saarlandes, Saarbrücken, 1998.
G.J. Chaitin. Incompleteness theorems for random reals. Adv. in Appl. Math., 8:119-146, 1987.
Qingliang Chen, Kaile Su, and Xizhong Zheng. Primitive recursive real numbers. Mathematical Logic Quarterly, 53(4-5):365-380, 2007.
Qingliang Chen, Kaile Su, and Xizhong Zheng. Primitive recursiveness of real numbers under different representation. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 303-324, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
A.V. Chernavskya and V.P. Leksineb. Unrecognizability of manifolds. Annals of Pure and Applied Logic, 141(3):447-455, 2006.
Arthur Chou and Ker-I Ko. Computational complexity of two-dimensional regions. SIAM Journal on Computing, 24:923-947, 1995.
Arthur W. Chou and Ker-I Ko. On the complexity of finding paths in a two-dimensional domain I: Shortest paths. Mathematical Logic Quarterly, 50(6):551-572, 2004.
Arthur W. Chou and Ker-I Ko. The computational complexity of distance functions of two-dimensional domains. Theoretical Computer Science, 337:360-369, 2005.
Arthur W. Chou and Ker-I Ko. On the complexity of finding paths in a two-dimensional domain II: Picewise straight-line paths. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 45-57, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.
Arthur W. Chou. Some complexity issues in complex analysis. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 91-98. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.
Alberto Ciaffaglione and Pietro Di Gianantonio. A co-inductive approach to real numbers. In Thierry Coquand, Peter Dybjer, Bengt Nordström, and Jan Smith, editors, Types for Proofs and Programs, volume 1956 of Lecture Notes in Computer Science, pages 114-130, Berlin, 2000. Springer. International Workshop, TYPES'99, Lökeberg, Sweden, June 12-16, 1999.
Alberto Ciaffaglione and Pietro Di Gianantonio. A tour with constructive real numbers. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Types for Proofs and Programs, volume 2277 of LNCS, pages 41-52, Berlin, 2002. Springer. International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000.
Alberto Ciaffaglione and Pietro Di Gianantonio. A certified, corecursive implementation of exact real numbers. Theoretical Computer Science, 351(1):39-51, 2006.
Gabriel Ciobanu and Danu c t Rusu. Supermetrics over apartness lattice-ordered semigroup. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 191-200. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
J.P. Cleave. The primitive recursive analysis of ordinary differential equations and the complexity of their solutions. Journal of Computer and Systems Sciences, 3:447-455, 1969.
W. Collins and P. Young. Discountinuities of provably correct operators on the provably recursive real numbers. The Journal of Symbolic Logic, 48:913-920, 1983.
W. Collins. Provably recursive real numbers. Notre Dame J. Formal Logic, 19:513-522, 1978.
Pieter Collins. Continuity and computability on reachable sets. Theoretical Computer Science, 341:162-195, 2005.
Pieter Collins. Effective computation for nonlinear systems. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 169-178, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.
Pieter Collins. Optimal semicomputable approximations to reachable and invariant sets. Theory of Computing Systems, 41(1):33-48, 2007.
Stephen A. Cook. Computability and complexity of higher type functions. In Y.N. Moschovakis, editor, Logic from computer science, volume 21 of Mathematical Sciences Research Institute Publications, pages 51-72, New York, 1992. Springer. Proceedings of the workshop held in Berkeley, California, November 13-17, 1989.
Thierry Coquand. Formal topology and constructive mathematics: the Gelfand and Stone-Yosida representation theorems. Journal of Universal Computer Science, 11(12):1932-1944, 2005.
José Félix Costa, Bruno Loff, and Jerzy Mycka. The new promise of analog computation. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 189-195, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.
Giovanni Curi. Constructive metrisability in point-free topology. Theoretical Computer Science, 305:85-109, 2003.
Fredrik Dahlgren. Computability and continuity in metric partial algebras equipped with computability structures. Mathematical Logic Quarterly, 50(4,5):486-500, 2004.
Fredrik Dahlgren. Partial continuous functions and admissible domain representations. In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, editors, Logical Approaches to Computational Barriers, volume 3988 of Lecture Notes in Computer Science, pages 94-104, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006.
Frédéric De Jaeger, Martín Escardó, and Gabriele Santini. On the computational content of the Lawson topology. Theoretical Computer Science, 357(1-3):230-240, 2006.
Gregorio de Miguel Casado, Juan Manuel García Chamizo, and María Teresa Signes Pont. Algebraic model of an arithmetic unit for TTE-computable normalized rational numbers. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 218-227, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.
H. de Swart. Elements of intuitionistic analysis II the Stone-Weierstrass theorem and Ascoli's theorem. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22(1):501-508, 1976.
H. de Swart. Elements of intuitionistic analysis. Rolle's theorem and complete, totally bounded, metric spaces. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 22(1):289-298, 1976.
Luminita Dediu and Douglas Bridges. Constructive notes on uniform and locally convex spaces. In G. Ciobanu and G. Pun, editors, Fundamentals of computation theory, volume 1684 of Lecture Notes in Computer Science, pages 195-203. Springer, Berlin, 1999. 12th International Symposium, FCT'99, Iasi, Romania, August/September 1999.
Thomas Deil. Darstellungen und Berechenbarkeit reeller Zahlen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984.
Osvald Demuth and Pavel Filipec. Differentiation of constructive functions of a real variable and relative computability. In D.G. Skordev, editor, Mathematical Logic and Its Applications, pages 81-106, New York, 1987. Plenum Press. Proceedings of an advanced international summer school and conference in honor of the 80th anniversary of Kurt Gödel's birth, held September 24-October 4, 1986 in Druzhba, Bulgaria.
Osvald Demuth and V. Kmínek. Properties of indefinite constructive Lebesgue-Stieltjes integrals (Russian). Commentationes Mathematicae Universitatis Carolinae, 21(4):629-644, 1980.
Osvald Demuth and A. Kucera. Remarks on constructive mathematical analysis. In Logic Colloquium '78 (Mons, 1978), pages 81-129. North-Holland, Amsterdam, 1979.
Osvald Demuth and A. Kucera. Remarks on 1-genericity, semigenericity and related concepts. Commentationes Mathematicae Universitatis Carolinae, 28(1):85-94, 1987.
Osvald Demuth and L. Nemeckova. The constructive analogue of the property (T sb 1) (Russian). Comment. Math. Univ. Carolinae, 14:421-439, 1973.
Osvald Demuth and L. Nemecková. The constructive analogues of the properties (N) and (S) (Russian). Comment. Math. Univ. Carolinae, 14:565-582, 1973.
Osvald Demuth and I. Polivka. The representation of linear functionals in the space of codes of constructive functions that are uniformly continuous on the segment 0 triangle 1 (Russian). Commentationes Mathematicae Universitatis Carolinae, 20(4):765-780, 1979.
Osvald Demuth, R. Kryl, and A. Kucera. The use of the theory of functions that are partial recursive relative to numerical sets in constructive mathematics (Russian). Acta Universitatis Carolinae. Mathematica et Physica, 19(1):15-60, 1978.
Osvald Demuth. On Lebesgue integration in constructive analysis (Russian). Dokl. Akad. Nauk SSSR, 160:1239-1241, 1965.
Osvald Demuth. The Lebesgue integral in constructive analysis (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 4:30-43, 1967. [translation in: A.O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic, Part II, Consultants Bureau, New York, 1970].
Osvald Demuth. A necessary and sufficient condition for the Riemann integrability of constructive functions. Dokl. Akad. Nauk SSSR, 176:757-758, 1967.
Osvald Demuth. The connection between Riemann and Lebesgue integrability of constructive functions (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 8:29-31, 1968. [translation in: A.O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic, Part II, Consultants Bureau, New York, 1970].
Osvald Demuth. Fubini's theorem for the Riemann integral in constructive mathematics. (Russian). Comment. Math. Univ. Carolinae, 9:677-686, 1968.
Osvald Demuth. The Lebesgue integral and the concept of measurability of functions in constructive analysis (Russian). Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov., 8:21-28, 1968. [translation in: A.O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic, Part II, Consultants Bureau, New York, 1970].
Osvald Demuth. The differentiability of constructive functions (Russian). Comment. Math. Univ. Carolinae, 10:167-175, 1969.
Osvald Demuth. The Lebesgue measurability of sets in constructive mathematic (Russian). Comment. Math. Univ. Carolinae, 10:463-492, 1969.
Osvald Demuth. Linear functionals in the constructive spaces L sb r (Russian). Comment. Math. Univ. Carolinae, 10:357-390, 1969.
Osvald Demuth. Note on the paper: ``Fubini's theorem for the Riemann integral in constructive mathematics'' (Russian). Comment. Math. Univ. Carolinae, 10:115-120, 1969.
Osvald Demuth. The spaces L sb n and S in constructive mathematics (Russian). Comment. Math. Univ. Carolinae, 10:261-284, 1969.
Osvald Demuth. The integrability of derivatives of constructive functions (Russian). Comment. Math. Univ. Carolinae, 11:667-691, 1970.
Osvald Demuth. Mean value theorems for the constructive Lebesgue integral (Russian). Comment. Math. Univ. Carolinae, 11:249-269, 1970.
Osvald Demuth. Necessary and sufficient conditions for the absolute continuity of constructive functions (Russian). Comment. Math. Univ. Carolinae, 11:705-726, 1970.
Osvald Demuth. The representability of constructive functions of weakly bounded variation (Russian). Comment. Math. Univ. Carolinae, 11:421-434, 1970.
Osvald Demuth. The representability of constructive functions of weakly bounded variation (Russian). Comment. Math. Univ. Carolinae, 11:421-434, 1970.
Osvald Demuth. A certain condition for the differentiability of constructive functions of bounded variation (Russian). Comment. Math. Univ. Carolinae, 12:687-711, 1971.
Osvald Demuth. A necessary and sufficient condition for the representability of constructive functions in the form of the sum of a singular and an absolutely continuous function (Russian). Comment. Math. Univ. Carolinae, 12:587-610, 1971.
Osvald Demuth. The superpositions of absolutely continuous constructive functions (Russian). Comment. Math. Univ. Carolinae, 12:423-451, 1971.
Osvald Demuth. A necessary and sufficient condition for the representability of constructive functions in the form of a superposition of absolutely continuous functions (Russian). Comment. Math. Univ. Carolinae, 13:227-251, 1972.
Osvald Demuth. A sufficient condition for the representability of constructive functions in the form of the sum of two superpositions of absolutely continuous functions (Russian). Comment. Math. Univ. Carolinae, 13:265-282, 1972.
Osvald Demuth. The constructive analogue of the connection between the Lebesgue measurability of sets and of functions (Russian). Comment. Math. Univ. Carolinae, 14:377-396, 1973.
Osvald Demuth. The representability of uniformly continuous constructive functions (Russian). Comment. Math. Univ. Carolinae, 14:7-25, 1973.
Osvald Demuth. The connection between the representability of a constructive function in the form of a superposition of two absolutely continuous functions and the differentiability of this function (Russian). Comment. Math. Univ. Carolinae, 15:195-210, 1974.
Osvald Demuth. The representability of constructive functions possessing the properties ( rm s) and ( rm t sb 1) in the form of superpositions (Russian). Comment. Math. Univ. Carolinae, 15:49-64, 1974.
Osvald Demuth. Constructive pseudonumbers (Russian). Comment. Math. Univ. Carolinae, 16:315-331, 1975.
Osvald Demuth. The differentiability of constructive functions of weakly bounded variation on pseudo numbers (Russian). Comment. Math. Univ. Carolinae, 16(3):583-599, 1975.
Osvald Demuth. The constructive analogue of the Denjoy-Young theorem on derived numbers (Russian). Comment. Math. Univ. Carolinae, 17(1):111-126, 1976.
Osvald Demuth. The domains of definition of effective operators over general recursive functions and of constructive functions of a real variable (Russian). Comment. Math. Univ. Carolinae, 17(4):633-646, 1976.
Osvald Demuth. A constructive analogue of the functions of the nth Baire class (Russian). Comment. Math. Univ. Carolinae, 18(2):231-245, 1977.
Osvald Demuth. A generalization of the constructive Lebesgue integral (Russian). Comment. Math. Univ. Carolinae, 18(3):499-514, 1977.
Osvald Demuth. Constructive analogues of generalized absolutely continuous functions of generalized bounded variation (Russian). Commentationes Mathematicae Universitatis Carolinae, 19(3):471-487, 1978.
Osvald Demuth. The pseudodifferentiability of uniformly continuous constructive functions on constructive real numbers (Russian). Comment. Math. Univ. Carolin., 19(2):319-333, 1978.
Osvald Demuth. Some questions of the theory of constructive functions of a real variable (Russian). Acta Universitatis Carolinae. Mathematica et Physica, 19(1):61-96, 1978.
Osvald Demuth. Constructive Denjoy integrals (Russian). Commentationes Mathematicae Universitatis Carolinae, 20(2):213-227, 1979.
Osvald Demuth. The use of the Riemann-Stieltjes integral in the theory of the constructive Lebesgue integral, and its generalizations (Russian). Commentationes Mathematicae Universitatis Carolinae, 20(4):781-793, 1979.
Osvald Demuth. A constructive analogue of K. M. Garg's theorem on derivative numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 21(3):457-472, 1980.
Osvald Demuth. On the constructive Perron integral (Russian). Acta Universitatis Carolinae. Mathematica et Physica, 21(1):3-57, 1980.
Osvald Demuth. Pseudodifferentiability of constructive functions on constructive real numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 21(3):489-505, 1980.
Osvald Demuth. A generalization of a constructive analogue of K. M. Garg's theorem (Russian). Commentationes Mathematicae Universitatis Carolinae, 22(3):607-620, 1981.
Osvald Demuth. On the pseudodifferentiability of uniformly continuous constructive functions from functions of the same type (Russian). Commentationes Mathematicae Universitatis Carolinae, 22(3):497-512, 1981.
Osvald Demuth. Borel types of some classes of arithmetical real numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 23(3):593-606, 1982.
Osvald Demuth. Some classes of arithmetical real numbers (Russian). Commentationes Mathematicae Universitatis Carolinae, 23(3):453-465, 1982.
Osvald Demuth. Arithmetic complexity of differentiation in constructive mathematics (Russian). Commentationes Mathematicae Universitatis Carolinae, 24(2):301-316, 1983.
Osvald Demuth. On the pseudodifferentiability of pseudo-uniformly continuous constructive functions from functions of the same type (Russian). Commentationes Mathematicae Universitatis Carolinae, 24(3):391-406, 1983.
Osvald Demuth. An example of the construction of pseudonumbers by the methods of recursion theory. In R.N. Tonoyan, editor, Applied mathematics, No. 5 (Russian), pages 55-73, 131-132, Erevan, 1987. Erevan. Univ.
Oswald Demuth. A notion of semigenericity. Commentationes Mathematicae Universitatis Carolinae, 28(1):71-84, 1987.
Osvald Demuth. Reducibilities of sets based on constructive functions of a real variable. Commentationes Mathematicae Universitatis Carolinae, 29(1):143-156, 1988.
Osvald Demuth. Remarks on the structure of tt-degrees based on constructive measure theory. Commentationes Mathematicae Universitatis Carolinae, 29(2):233-247, 1988.
Osvald Demuth. Remarks on Denjoy sets. In Mathematical logic, pages 267-280, New York, 1990. Plenum.
H.J. Dettki, H. Schuster, and K. Weihrauch. Type 2 recursion theory. In J. Demetrovics, G. Katona, and A. Salomaa, editors, Algebra, Combinatorics and Logic in Computer Science, Vol. 1, volume 42 of Coll. Math. Soc. János Bolyai, pages 355-361, 1986. Papers from Colloq., Sept. 12-16, 1983, Györ.
Hans Joachim Dettki. Untersuchungen zur Darstellungsberechenbarkeit von Ordinalzahlfunktionen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1985.
Pietro Di Gianantonio. A Functional Approach to Computability on Real Numbers. Dottorato di ricerca in informatica, Università di Pisa-Genova-Udine, Udine, June 1993.
Pietro Di Gianantonio. Real number computation and domain theory. Information and Computation, 127:11-25, 1996.
Pietro Di Gianantonio. An abstract data type for real numbers. Theoretical Computer Science, 221:295-326, 1999.
Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors. Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
Ruth Dillhage. Computability of the spectrum of self-adjoint operators and the computable operational calculus. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 365-384. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.
Decheng Ding, Klaus Weihrauch, and Yongcheng Wu. Absolutely non-effective predicates and functions in computable analysis. In Jin-Yi Cai, S. Barry Cooper, and Hong Zhou, editors, Theory and Applications of Models of Computation, volume 4484 of Lecture Notes in Computer Science, pages 595-604, 2007.
Phan Dình-Diêu. Constructive locally convex linear topological spaces (Russian). Doklady Akademii Nauk, 162:766-769, 1965.
Phan Dình-Diêu. The metrizability, normability and multinormability of constructive locally convex spaces (Russian). Doklady Akademii Nauk, 162:1011-1014, 1965.
Phan Dình-Diêu. On conjugates to constructive, locally convex spaces (Russian). Doklady Akademii Nauk, 166:45-48, 1966.
Phan Dình-Diêu. Certain properties of constructive generalized functions (Russian). Doklady Akademii Nauk, 174:298-301, 1967.
Phan Dình-Diêu. Closed and open sets in constructive topological spaces (Russian). Trudy Mat. Inst. Steklova, 93:250-256, 1967.
Phan Dình-Diêu. Constructive generalized functions (Russian). Doklady Akademii Nauk, 174:37-40, 1967.
Phan Dình-Diêu. A language for constructive mathematics, connected with systems of sets (Russian). Trudy Mat. Inst. Steklova, 93:123-141, 1967.
Phan Dình-Diêu. Spaces of constructive infinitely differentiable functions, and functionals therein (Russian). Doklady Akademii Nauk, 180:799-802, 1968.
Phan Dình-Diêu. Some questions in constructive functional analysis, volume 114 of Proceedings of the Steklov Institute of Mathematics. American Mathematical Society, Providence, 1974.
Rod G. Downey and Evan J. Griffiths. Schnorr randomness. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.
Rod Downey and Iraj Kala