A semantics of realisability for the classical propositional natural deduction

Simple item page
dc.creatorNour, Karim
dc.creatorSaber, Khelifa
dc.date2009-05-11
dc.date.accessioned2026-07-07T13:13:39Z
dc.date.available2026-07-07T13:13:39Z
dc.descriptionIn 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.
dc.descriptionSecond Workshop on Computational Logic and Applications (CLA 2004), Lyon : France (2004)
dc.identifierhttps://arxiv.org/abs/0905.1555
dc.identifierhttp://arxiv.org/abs/0905.1555
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229961
dc.subjectLogic
dc.titleA semantics of realisability for the classical propositional natural deduction
dc.typetext

Files

Collections

arXiv