Computational Content of Classical Logic (1996)
Edit Page
Report
Scan day: 05 March 2014 UTC
19
Virus safety - good
Description: Lecture notes from a research seminar series by Thierry Coquand covering double-negation translations, game semantics of classical logic and point-free topology.
CiteSeerX — Computational Content of Classical Logic Computational Content of Classical Logic (1996) Semantics and Logics of Computation @INPROCEEDINGS{Coquand96computationalcontent,     author = {Thierry Coquand},
Size: 220 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | CiteSeerX — Computational Content of Classical Logic |
| Keywords: | CiteSeerX, Thierry Coquand |
| Description: | CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): This course is an introduction to the research trying to connect the proof theory of classical logic and computer science. We omit important and standard topics, among them the connection between the computational interpretation of classical logic and the programming operator callcc. Instead, here we put the emphasis on actual mathematical examples. We analyse the following questions: what can be the meaning of a non-effective proof of an existential statement, a statement that claims the existence of a finite object that satisfies a decidable property? Is it clear that a non-effective proof has a meaning at all? Can we always say that this proof contains implicitly, if not explicitly, some effective witness? Is this witness unique? By putting the emphasis on actual mathematical examples, we follow Gentzen who founded natural deduction by analysing concrete mathematical examples, like Euclid's proof of the infinity of prime numbers |
| IP-address: | 130.203.136.95 |
WHOIS Info
| NS | Name Servers: NS1.PSU.EDU 128.118.25.6 NS2.PSU.EDU 128.118.70.6 |
| WHOIS | |
| Date | activated: 14-Jul-1986 last updated: 22-May-2013 expires: 31-Jul-2014 |