On the computational interpretation of negation
From MaRDI portal
Recommendations
- Formulae-as-types for an involutive negation
- A computational interpretation of the -calculus
- Strong normalization of second order symmetric -calculus
- Strong normalization of \(\lambda^{\mathrm{Sym}}_{\mathrm{Prop}}\)- and \(\overline{\lambda}\mu\overline{\mu}^\ast\)-calculi
- scientific article; zbMATH DE number 2038177
Cited in
(7)- Strong normalization of the second-order symmetric \(\lambda \mu\)-calculus
- Covert movement in logical grammar
- The Non-Boolean Logic of Natural Language Negation
- scientific article; zbMATH DE number 1160599 (Why is no real title available?)
- Formulae-as-types for an involutive negation
- An extended type system with lambda-typed lambda-expressions
- Adding Negation to Lambda Mu
This page was built for publication: On the computational interpretation of negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753693)