Skip to main content
×
Home
    • Aa
    • Aa

Sets in homotopy type theory

  • EGBERT RIJKE (a1) and BAS SPITTERS (a1)
Abstract

Homotopy type theory may be seen as an internal language for the ∞-category of weak ∞-groupoids. Moreover, weak ∞-groupoids model the univalence axiom. Voevodsky proposes this (language for) weak ∞-groupoids as a new foundation for Mathematics called the univalent foundations. It includes the sets as weak ∞-groupoids with contractible connected components, and thereby it includes (much of) the traditional set theoretical foundations as a special case. We thus wonder whether those ‘discrete’ groupoids do in fact form a (predicative) topos. More generally, homotopy type theory is conjectured to be the internal language of ‘elementary’ of ∞-toposes. We prove that sets in homotopy type theory form a ΠW-pretopos. This is similar to the fact that the 0-truncation of an ∞-topos is a topos. We show that both a subobject classifier and a 0-object classifier are available for the type theoretical universe of sets. However, both of these are large and moreover the 0-object classifier for sets is a function between 1-types (i.e. groupoids) rather than between sets. Assuming an impredicative propositional resizing rule we may render the subobject classifier small and then we actually obtain a topos of sets.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Sets in homotopy type theory
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Sets in homotopy type theory
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Sets in homotopy type theory
      Available formats
      ×
Copyright
Footnotes
Hide All

The research leading to these results has received funding from the European Union's 7th Framework Programme under grant agreement nr. 243847 (ForMath).

Footnotes
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

S. Awodey and A. Bauer (2004) Propositions as [types]. Journal of Logic and Computation 14 (4) 447471.

P. Hancock , C. McBride , N. Ghani , L. Malatesta and T. Altenkirch (2013) Small induction recursion. In: M. Hasegawa (ed.) Typed Lambda Calculi and Applications, Lecture Notes in Computer Science volume 7941, Springer156172. doi:10.1007/978-3-642-38946-7_13.

A. Joyal and I. Moerdijk (1995) Algebraic Set Theory, London Mathematical Society Lecture Note Series volume 220, Cambridge. doi:10.1017/CBO9780511752483.

F. Lawvere and R. Rosebrugh (2003) Sets for Mathematics, Cambridge. doi:10.1017/CBO9780511755460.

M. E. Maietti (2005) Modular correspondence between dependent type theories and categories including pretopoi and topoi. Mathematical Structures in Computer Science 15 10891149,. Available at: http://journals.cambridge.org/article_S0960129505004962, doi:10.1017/S0960129505004962.

R. Mines , F. Richman and W. Ruitenburg (1988) A Course in Constructive Algebra, Springer. doi:10.1007/978-1-4419-8640-5.

I. Moerdijk and E. Palmgren (2002) Type theories, toposes and constructive set theory: Predicative aspects of AST. Annals of Pure and Applied Logic 114 (1-3) 155201. doi:10.1016/S0168-0072(01)00079-3.

T. Streicher (1992) Independence of the induction principle and the axiom of choice in the pure calculus of constructions. Theoretical Computer Science 103 (2) 395408. doi:10.1016/0304-3975(92)90021-7.

T. Streicher (2014) A model of type theory in simplicial sets. Journal of Applied Logic 12 (1) 4549. doi:10.1016/j.jal.2013.04.001.

B. Werner (1997) Sets in types, types in sets. In: Theoretical Aspects of Computer Software, Springer530546. doi:10.1016/j.jal.2013.04.001.

O. Wilander (2010) Setoids and universes. Mathematical Structures in Computer Science 20 (4) 563576. doi:10.1017/S0960129510000071.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 22 *
Loading metrics...

Abstract views

Total abstract views: 97 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 27th May 2017. This data will be updated every 24 hours.