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 |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |