First Page | Document Content | |
---|---|---|
Date: 2006-07-26 07:36:55Mathematics Logic Theoretical computer science Mathematical logic Automated theorem proving Type theory Logic in computer science Nqthm Mathematical induction Mathematical proof Recursive definition Induction | RAC Rev. R. Acad. Cien. Serie A. Mat. VOL), 2004, pp. 153–180 Ciencias de la Computaci´on / Computational SciencesAdd to Reading ListSource URL: www-i2.informatik.rwth-aachen.deDownload Document from Source WebsiteFile Size: 285,64 KBShare Document on Facebook |
Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–1472) HITCHIN TYPE MODULI STACKS IN AUTOMORPHIC REPRESENTATION THEORY Zhiwei Yun (恽之玮)DocID: 1xVTT - View Document | |
An adequacy theorem for partial type theory j.w.w. Simon Huber G¨ oteborg, May 11, 2017 An adequacy theorem for partial type theoryDocID: 1v8ox - View Document | |
E6(6) Exceptional Field Theory: Applications to Type IIB Supergravity on AdS5 ×S5 Arnaud Baguet ´ Ecole Normale Sup´DocID: 1v5Rr - View Document | |
Univalent Type Theory Thierry Coquand Tutorial for the Logic Colloquium 2016, Leeds Univalent Type TheoryDocID: 1uZ9e - View Document | |
Collection Principles in Dependent Type Theory? Peter Aczel1 and Nicola Gambino2 1 Departments of Mathematics and Computer Science, University of Manchester,DocID: 1uXqs - View Document |