Proof Theory in Type Theory (ResearchIndex)

See this document in CiteSeerX!

Proof Theory in Type Theory (1996) (Make Corrections)
Thierry Coquand

Rate this article:

(Enter summary)
Abstract: Introduction The negative translation provides a general way to make constructive sense of some non effective reasoning. However this method has some limitations. It does not work in presence of the axiom of description/choice. In this note, we analyse the interaction of classical logic with generalised inductive definition. In the metatheory, we allow generalised inductive definitions, but with an intuitionistic logic. Actually, we can take as our metatheory a system like Martin-Lof type... (Update)

Active bibliography (related documents): More All
0.4: Inductive Definitions and Type Theory: An Introduction - Coquand, Dybjer (Correct)
0.1: Adams Operations On Higher K-Theory - Grayson (1992) (Correct)
0.1: Representable E-Theory For C_0(X)-Algebras - Park, Trout (Correct)

Similar documents based on text: More All
0.1: The Calculus of Constructions and Higher Order Logic - Geuvers (1992) (Correct)
0.1: Proof Theory Since 1960 - Feferman (Correct)
0.1: A Metatheory of a Mechanized Object Theory - Giunchiglia, Traverso (1992) (Correct)

BibTeX entry: (Update)

@misc{ coquand-proof,
  author = "Thierry Coquand",
  title = "Proof Theory in Type Theory",
  url = "citeseer.ist.psu.edu/coquand96proof.html" }