Pedagogical Natural Deduction Systems: the Propositional Case
| dc.creator | Colson,Loïc | |
| dc.creator | Michel,David | |
| dc.date | 2007 | |
| dc.date.accessioned | 2024-02-06T12:55:53Z | |
| dc.date.available | 2024-02-06T12:55:53Z | |
| dc.description | This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a proof must be motivated by some example. It is established that such systems are negationless. The expressive power of the pedagogical version of some propositional calculi are studied. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-013-10-1396 | |
| dc.identifier | https://lib.jucs.org/article/28861/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/9495 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 13(10): 1396-1410 | |
| dc.subject | mathematical logic | |
| dc.subject | negationless mathematics | |
| dc.subject | constructive mathematics | |
| dc.subject | natural deduction | |
| dc.subject | typed λ-calculus | |
| dc.title | Pedagogical Natural Deduction Systems: the Propositional Case | |
| dc.type | Research Article |