Article ID Journal Published Year Pages File Type
9655861 Electronic Notes in Theoretical Computer Science 2005 9 Pages PDF
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.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A Semantics of Realisability for the Classical Propositional Natural Deduction
Authors
, ,