A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Mitsuhiro Okada. A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoretical Computer Science, 281(1-2):471-498, 2002. [doi]

Abstract

Abstract is missing.