scientific article; zbMATH DE number 2051382
From MaRDI portal
Publication:4453638
zbMath1043.03042MaRDI QIDQ4453638
Publication date: 7 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)
Related Items (2)
Quick cut-elimination for strictly positive cuts ⋮ Intuitionistic fixed point theories over set theories
This page was built for publication: