Skip to main content
×
Home
    • Aa
    • Aa

Setoids and universes

  • OLOV WILANDER (a1)
Abstract

Setoids commonly take the place of sets when formalising mathematics inside type theory. In this note, the category of setoids is studied in type theory with universes that are as small as possible (and thus, the type theory is as weak as possible). In particular, we will consider epimorphisms and disjoint sums. We show that, given the minimal type universe, all epimorphisms are surjections, and disjoint sums exist. Further, without universes, there are countermodels for these statements, and if we use the Logical Framework formulation of type theory, these statements are provably non-derivable.

Copyright
References
Hide All
Bishop E. (1967) Foundations of constructive analysis, McGraw-Hill.
Bishop E. and Bridges D. (1985) Constructive analysis, Grundlehren der Mathematischen Wissenschaften 279.
Carboni A. (1995) Some free constructions in realizability and proof theory. J. Pure Appl. Algebra 103 (2)117148.
Carboni A., Lack S. and Walters R. F. C. (1993) Introduction to extensive and distributive categories. J. Pure Appl. Algebra 84 (2)145158.
Coquand T., Dybjer P., Palmgren E. and Setzer A. (2005) Type-theoretic foundations of constructive mathematics (draft). Notes distributed at the 2005 TYPES Summer School, Göteborg, Sweden.
Fridlender D. (2002) A proof-irrelevant model of Martin-Löf's logical framework. Mathematical Structures in Computer Science 12 (6)771795.
Maietti M. E. (1998) The type theory of categorical universes, Ph.D. thesis, Università degli studi di Padova, Padua, Italy.
Maietti M. E. (2005) Modular correspondence between dependent type theories and categories including pretopoi and topoi. Mathematical Structures in Computer Science 15 (6)10891149.
Maietti M. E. (2007) Quotients over minimal type theory. In: Cooper S. B., Löwe B. and Sorbi A. (eds.) Computation and logic in the real world, third conference on computability in Europe, CiE 2007. Springer-Verlag Lecture Notes in Computer Science 4497 517–531.
Maietti M. E. (2009) A minimalist two-level foundation for constructive mathematics. Ann. Pure Appl. Logic 160 (3)319354.
Martin-Löf P. (1984) Intuitionistic type theory: Notes by Giovanni Sambin of a Series of Lectures Given in Padua, June 1980, Studies in Proof Theory, Lecture Notes, volume 1, Bibliopolis.
Mines R., Richman F. and Ruitenburg W. (1988) A course in constructive algebra, Universitext, Springer-Verlag.
Nederpelt R. P., Geuvers J. H. and van Daalen D. T. (eds.) Selected papers on Automath. Studies in Logic and the Foundations of Mathematics 133, North-Holland.
Nordström B., Petersson K. and Smith J. M. (1990) Programming in Martin-Löf's type theory, International Series of Monographs on Computer Science 7, The Clarendon Press.
Nordström B., Petersson K. and Smith J. M. (2000) Martin-Löf's type theory. In: Handbook of logic in computer science 5, Oxford University Press 137.
Smith J. M. (1988) The independence of Peano's fourth axiom from Martin-Löf's type theory without universes. J. Symbolic Logic 53 (3)840845.
Smith J. M. (1989) Propositional functions and families of types. Notre Dame J. Formal Logic 30 (3)442458.
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: 4 *
Loading metrics...

Abstract views

Total abstract views: 35 *
Loading metrics...

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