Pages that link to "Item:Q2708321"
From MaRDI portal
The following pages link to Strong normalisation of cut-elimination in classical logic (Q2708321):
Displaying 18 items.
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- A minimal classical sequent calculus free of structural rules (Q636359) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- Categorical proof theory of classical propositional calculus (Q860833) (← links)
- On the form of witness terms (Q982183) (← links)
- The computational content of arithmetical proofs (Q1762353) (← links)
- A strong normalization result for classical logic (Q1902976) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- Proof nets for classical logic (Q1982017) (← links)
- (Q2778837) (← links)
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types (Q3184667) (← links)
- (Q3384900) (← links)
- SN and CR for free-style <i>LK<sup>tq</sup></i>: linear decorations and simulation of normalization (Q4532608) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- Cut Elimination, Substitution and Normalisation (Q5213610) (← links)
- Expansion trees with cut (Q5236547) (← links)
- Revisiting Zucker’s Work on the Correspondence Between Cut-Elimination and Normalisation (Q5251185) (← links)
- Proof theory in the abstract (Q5957852) (← links)
