Grant: Discovery Grants Program - Individual
University of Ottawa
$10,000.00
The category of realizability toposes
FY 2007-08
Summary
Realizability is an overarching name for a family of interpretations of constructive systems. Ultimately, such an interpretation relies on a notion of effective computation, and it provides a connection between such a notion of computation and the notion of a constructive proof.On the other hand, categorical logic, and in particular topos theory, gives a very general way of interpreting constructive theories. Subsuming various other types of semantics for constructive theories (such as Kripke models and Heyting-valued semantics), it has been widely used to provide models for consistency and independence results.Combining the two types of semantics, one obtains a so-called realizability topos. Many of such toposes have been constructed, and they turned out to have remarkable properties, with surprising applications to theoretical computer science and constructive mathematics.However, realizability toposes turn out to be a different kind of toposes than their geometric counterparts, Grothendieck toposes. Whereas the theory of the latter class is well-developed, most realizability toposes have been studied in isolation only, and no good understanding is available of what this world of toposes as a whole looks like. Indeed, it has been compared to a stamp collection.This project is aimed at obtaining a structural understanding of the world of realizability toposes by organizing them in a suitable framework, and by studying the properties of this framework. As realizability is ultimately concerned with computation, this will require a study of certain models of computation, and of the ways in which they can interact.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
341826-2007
Name nom
Hofstra, Pieter
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2007
Award amount
10000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2912
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Logic
Research subject fr
Logique
Partie
1
Nb partie
5
Application title
The category of realizability toposes
Keyword
NA
Application summary
Realizability is an overarching name for a family of interpretations of constructive systems. Ultimately, such an interpretation relies on a notion of effective computation, and it provides a connection between such a notion of computation and the notion of a constructive proof.On the other hand, categorical logic, and in particular topos theory, gives a very general way of interpreting constructive theories. Subsuming various other types of semantics for constructive theories (such as Kripke models and Heyting-valued semantics), it has been widely used to provide models for consistency and independence results.Combining the two types of semantics, one obtains a so-called realizability topos. Many of such toposes have been constructed, and they turned out to have remarkable properties, with surprising applications to theoretical computer science and constructive mathematics.However, realizability toposes turn out to be a different kind of toposes than their geometric counterparts, Grothendieck toposes. Whereas the theory of the latter class is well-developed, most realizability toposes have been studied in isolation only, and no good understanding is available of what this world of toposes as a whole looks like. Indeed, it has been compared to a stamp collection.This project is aimed at obtaining a structural understanding of the world of realizability toposes by organizing them in a suitable framework, and by studying the properties of this framework. As realizability is ultimately concerned with computation, this will require a study of certain models of computation, and of the ways in which they can interact.