Arithmetic Universes


Introduction

Following Lawvere's categorical treatment of algebraic theories, which abstracts so successfully from syntax based presentations, many mathematicians felt that much of mathematical logic would be better formulated categorically. In 1973, André Joyal proposed a categorical formulation of Gödel's incompleteness theorem for theories of arithmetic. As with Lawvere's treatment of algebraic theories, Joyal's proposal uses categorical structure to abstract from the details of the syntax of arithmetic theories. In particular, Joyal's proof includes an abstract account of Gödel numbering. This sort of high level formulation should make it easier to apply and extend Gödel's result and related results.

It has been suggested by Vickers (1999) that, quite independently from incompleteness results, Joyal's notion of Arithmetic Universe may provide a good strength of logic for specifying computations. Maietti (1999) has identified a dependently typed internal language for Arithmetic Universes and exploits this to demonstrate the existence of some useful constructions in Arithmetic Universes. Taylor observes that every Arithmetic Universe may be represtented as the category of overt discrete spaces in a model of ASD.

References

People

14 September 2004, A. Eppendahl http://homepage.mac.com/a.eppendahl/work/arith-univ.html