A semantics of realisability for the classical propositional natural deduction
arXiv:0905.1555
Abstract
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.
Second Workshop on Computational Logic and Applications (CLA 2004), Lyon : France (2004)