HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

A Type-Free Formalization of Mathematics where Proofs are Objects

Gilles Dowek 1
1 COQ - Formal Specifications and Program Validation
Inria Paris-Rocquencourt
Abstract : We present a first order untyped axiomatization of mathematics where proofs are objects in the sense of Heyting-Kolmogorov functional interpretation. The consistency of this theory is open.
Keywords : GODEL'S THEOREM TARSKI'S THEOREM FUNCTIONNAL INTERPRETATION OF PROOFS REFLECTION FORMALIZATION OF MATHEMATICS SET THEORY
Document type :
Reports
Complete list of metadata
https://hal.inria.fr/inria-00073782
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:44:55 PM
Last modification on : Friday, February 4, 2022 - 3:08:10 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:58:03 PM

Files

Vignette du document
RR-2915.pdf

Identifiers

  • HAL Id : inria-00073782, version 1

Collections

INRIA | INRIA-RRRT | LARA | INRIA2

Citation

Gilles Dowek. A Type-Free Formalization of Mathematics where Proofs are Objects. [Research Report] RR-2915, INRIA. 1996. ⟨inria-00073782⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

36

Files downloads

150

 

Contact                    Legal Notice                    Personal Data