Computer Science – Logic in Computer Science
Scientific paper
2012-03-15
Computer Science
Logic in Computer Science
18 pages
Scientific paper
In the last few years appeared pedagogical propositional natural deduction systems. In these systems, one must satisfy the pedagogical constraint: the user must give an example of any introduced notion. First we expose the reasons of such a constraint and properties of these "pedagogical" calculi: the absence of negation at logical side, and the "usefulness" feature of terms at computational side (through the Curry-Howard correspondence). Then we construct a simple pedagogical restriction of the calculus of constructions (CC) called CCr. We establish logical limitations of this system, and compare its computational expressiveness to Godel system T. Finally, guided by the logical limitations of CCr, we propose a formal and general definition of what a pedagogical calculus of constructions should be.
Colson Loïc
Demange Vincent
No associations
LandOfFree
Investigations on a Pedagogical Calculus of Constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Investigations on a Pedagogical Calculus of Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Investigations on a Pedagogical Calculus of Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348094