Observations about definability in an abstract datatype of real numbers

Add to your list(s) Download to your calendar using vCal

• Alex Simpson, University of Edinburgh
• Friday 03 February 2012, 13:00-14:00
• 217 Computer Science.

If you have a question about this talk, please contact Paul Levy.

This talk reprises joint work with Martin Escardo from more than 10 years ago (LICS 2001). There, we defined a notion of “interval object” in a category, identifying a universal property for a closed interval of real numbers. The universal property is phrased entirely in terms of structure that is computable, and leads naturally to an abstract datatype for a closed interval. Recently, Martin suggested adding such a datatype to Goedel’s System T. The talk will survey what we know about definability and undefinability of functions on real numbers in the resulting system.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• 217 Computer Science
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.