On model-theoretic strong normalization for truth-table natural deduction
From MaRDI portal
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A symmetric lambda calculus for classical program extraction
- Deriving natural deduction rules from truth tables
- scientific article; zbMATH DE number 1615235 (Why is no real title available?)
- scientific article; zbMATH DE number 1670484 (Why is no real title available?)
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 2080223 (Why is no real title available?)
- scientific article; zbMATH DE number 1424053 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Intensional interpretations of functionals of finite type I
- Locus solum: From the rules of logic to the logic of rules.
- Non-strictly positive fixed points for classical natural deduction
- Normalization without reducibility
- Parametric polymorphism and operational equivalence
- Proof Terms for Generalized Natural Deduction
- Proofs of strong normalisation for second order classical natural deduction
- Semantic types: a fresh look at the ideal model for types
- Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
- Strong normalization for truth table natural deduction
- Strongly typed term representations in Coq
- Typed Lambda Calculi and Applications
- Typed Lambda Calculi and Applications
- Untersuchungen über das logische Schliessen. II
This page was built for publication: On model-theoretic strong normalization for truth-table natural deduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232178)
