University of Birmingham > Talks@bham > Theoretical computer science seminar > Observations about definability in an abstract datatype of real numbers

Observations about definability in an abstract datatype of real numbers

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.