A semantics of realisability for the classical propositional natural deduction

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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)

Keywords

Logic

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/229961

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.1555
 http://arxiv.org/abs/0905.1555

Collections

arXiv