A new technique for proving realisabilit
โ
Arief Daynes
๐
Article
๐
2006
๐
John Wiley and Sons
๐
English
โ 177 KB
## Abstract A new technique for proving realisability results is presented, and is illustrated in detail for the simple case of arithmetic minus induction. CL is a Gentzen formulation of classical logic. CPQ is CL minus the Cut Rule. The basic proof theory and model theory of CPQ and CL is develope