A semantics of realisability for the classical propositional natural deduction
classification
🧮 math.LO
keywords
classicaldeductionnaturalpropositionalrealisabilitysemanticsallowsbehaviour
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.