A semantics of realisability for the classical propositional natural deduction
Logic
2009-05-12 v1
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.
Cite
@article{arxiv.0905.1555,
title = {A semantics of realisability for the classical propositional natural deduction},
author = {Karim Nour and Khelifa Saber},
journal= {arXiv preprint arXiv:0905.1555},
year = {2009}
}
Comments
Second Workshop on Computational Logic and Applications (CLA 2004), Lyon : France (2004)