Strong normalization of classical natural deduction with disjunction
From MaRDI portal
Recommendations
- A short proof of the strong normalization of classical natural deduction with disjunction
- Strong normalization of classical natural deduction with disjunctions
- Strong normalization results by translation
- On the semantics of classical disjunction
- Arithmetical proofs of strong normalization results for symmetric lambda calculi
Cited in
(20)- Counting proofs in propositional logic
- Non-strictly positive fixed points for classical natural deduction
- Hypothetical logic of proofs
- Strong normalization of classical natural deduction with disjunctions
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- On natural deduction for Herbrand constructive logics. I: Curry-Howard correspondence for Dummett's logic \(\mathsf {LC}\)
- Proofs of strong normalisation for second order classical natural deduction
- An estimation for the lengths of reduction sequences of the -calculus
- Some properties of the \(\lambda\mu^{\wedge\vee}\)-calculus
- A short proof of the strong normalization of classical natural deduction with disjunction
- On the strong normalisation of natural deduction with permutation-conversions
- scientific article; zbMATH DE number 7393562 (Why is no real title available?)
- Programming and Proving with Classical Types
- Disjunctive normal forms and local exceptions
- Classical Logic with Mendler Induction
- On the semantics of classical disjunction
- Adding Negation to Lambda Mu
- Strong normalization results by translation
- A semantical proof of the strong normalization theorem for full propositional classical natural deduction
- Strong normalization proofs by CPS-translations
This page was built for publication: Strong normalization of classical natural deduction with disjunction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778822)
