en-de
en-es
en-fr
en-pt
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Towards a new Computational Interpretation of Sub Classical
Published on May 20, 20113266 Views
Related categories
Chapter list
Towards a New Computational Interpretation of Sub-classical Principles00:00
Delimited Control Operators00:57
Delimited Control Operators: Logical Explanation06:11
Delimited Control Operators: Example 1 – use as “exceptions” - 107:44
Delimited Control Operators: Example 1 – use as “exceptions” - 208:52
Delimited Control Operators: Example 1 – use as “exceptions” - 309:07
Delimited Control Operators: Example 2 – full use - 109:11
Delimited Control Operators: Example 2 – full use - 209:28
Delimited Control Operators: Example 2 – full use - 309:33
Delimited Control Operators: Example 2 – full use - 409:37
MQC+ – Intuitionistic Extension of Intuitionistic Logic - 109:39
MQC+ – Intuitionistic Extension of Intuitionistic Logic - 210:50
MQC+ – Intuitionistic Extension of Intuitionistic Logic - 310:57
MQC+ – Intuitionistic Extension of Intuitionistic Logic - 411:30
MQC+ – Intuitionistic Extension of Intuitionistic Logic - 512:02
MQC+ – Intuitionistic Extension of Intuitionistic Logic - 612:18
MQC+ – Examples of Derivations - 113:11
MQC+ – Examples of Derivations - 214:33
Kripke - CPS Models - 115:21
Kripke - CPS Models - 216:28
Extension of Glivenko’s Theorem to Predicate Logic18:27
Towards a New Computational Interpretation of Sub - classical Principles19:38
A System Unifying Current Approaches19:46
Constructive Reverse Mathematics20:20
Constructive proofs of completeness - 121:14
Constructive proofs of completeness - 221:53
Revisiting Dialectica and Bar Recursion22:17
Computational Effects22:31