A Semantics of Realisability for the Classical Propositional Natural Deduction
Karim Nour, Khelifa Saber · Electronic Notes in Theoretical Computer Science · 2005
In this paper, we introduce a semantics of realisability for the classical propositional natural deduction and we prove a correctness theorem. This allows to characterize the operational behaviour of some typed terms.