I am interested in studying the complexity of mathematical practice. In mathematics, as we all know, some structures are more complicated than others, some constructions more complicated than others, and some proofs more complicated than others. I am interested in understanding how to measure this complexity and in measuring it. The motivations for this come from different areas. Form a foundational viewpoint, we want to know what assumptions we really need to do mathematics (ZF C is way much more than we usually use), and we are also interested in knowing what assumptions are used in the different areas of mathematics. Form a computational viewpoint, it is important to know what part of mathematics can be done by mechanical algorithms, and, even for the part that can’t be done mechanically, we want to know how constructive are the objects we deal with. Furthermore, it is sometimes the case that this computational analysis allows us to find connections between constructions in different areas of mathematics, and in many cases to obtain a deeper understanding of mathematical objects being analyzed. My work is quite diverse in terms of the techniques I have used, the approaches I have taken, and the areas of mathematics that I have analyzed. However, my background area is Computability Theory, and most of my work can be considered as part of this branch of Mathematical Logic

Year: 2010

OAI identifier:
oai:CiteSeerX.psu:10.1.1.169.926

Provided by:
CiteSeerX

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.