A Sequent Calculus for Type Theory

DOI10.1007/11874683_29zbMath1225.03010OpenAlexW2160135306MaRDI QIDQ3613355

Roy Dyckhoff, James McKinna, Stéphane Lengrand

Publication date: 12 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11874683_29

zbMATH Keywords

sequent calculustype theoryPTSstrong normalisationproof-search

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05)

Related Items (1)

Call-by-name reduction and cut-elimination in classical logic

This page was built for publication: A Sequent Calculus for Type Theory