Table of Contents
Fetching ...

A minimalist two-level foundation for constructive mathematics

Maria Emilia Maietti

Abstract

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin. One level is given by an intensional type theory, called Minimal type theory. This theory extends the set-theoretic version introduced in the mentioned paper with collections. The other level is given by an extensional set theory which is interpreted in the first one by means of a quotient model. This two-level theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; it is constructive thanks to the way the extensional level is linked to the intensional one which fulfills the "proofs-as-programs" paradigm and acts as a programming language.

A minimalist two-level foundation for constructive mathematics

Abstract

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin. One level is given by an intensional type theory, called Minimal type theory. This theory extends the set-theoretic version introduced in the mentioned paper with collections. The other level is given by an extensional set theory which is interpreted in the first one by means of a quotient model. This two-level theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; it is constructive thanks to the way the extensional level is linked to the intensional one which fulfills the "proofs-as-programs" paradigm and acts as a programming language.

Paper Structure

This paper contains 11 sections, 16 theorems, 128 equations.

Key Result

Lemma 4.3

${\mathcal{P}_q}$ is an indexed category satisfying the universal property of comprehension.

Theorems & Definitions (23)

  • Lemma 4.3
  • Lemma 4.8
  • Proposition 4.12
  • Lemma 4.14
  • Lemma 4.16
  • Corollary 4.17
  • Theorem 4.20
  • Proposition 4.21
  • Theorem 4.22
  • Remark 4.23
  • ...and 13 more