scientific article
From MaRDI portal
Publication:2708321
zbMath0982.03032MaRDI QIDQ2708321
No author found.
Publication date: 14 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear logiccut-eliminationlambda calculusnormalisationcontraction rulenotation systemsterm-rewriting
Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (15)
A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types ⋮ Categorical proof theory of classical propositional calculus ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ Some general results about proof normalization ⋮ A minimal classical sequent calculus free of structural rules ⋮ Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) ⋮ Unnamed Item ⋮ Proof nets for classical logic ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ The computational content of arithmetical proofs ⋮ On the form of witness terms ⋮ Proof theory in the abstract ⋮ Cut Elimination, Substitution and Normalisation ⋮ Expansion trees with cut ⋮ Revisiting Zucker’s Work on the Correspondence Between Cut-Elimination and Normalisation
This page was built for publication:
