Lattice-valued representation of the cut-elimination theorem

DOI10.21099/TKBJM/1496161672zbMath0758.03026OpenAlexW212831703MaRDI QIDQ1192582

Shôji Maehara

Publication date: 27 September 1992

Published in: Tsukuba Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21099/tkbjm/1496161672

zbMATH Keywords

formal systemcut-elimination theoremrelatively pseudo-complemented lattice

Mathematics Subject Classification ID

Logical aspects of lattices and related structures (03G10) Cut-elimination and normal-form theorems (03F05)

Related Items (6)

Cut elimination and strong separation for substructural logics: an algebraic approach ⋮ First-order automated reasoning with theories: when deduction modulo theory meets practice ⋮ Beyond Rasiowa's algebraic approach to non-classical logics ⋮ MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics ⋮ Hyper-MacNeille completions of Heyting algebras ⋮ Cut-Elimination for SBL

This page was built for publication: Lattice-valued representation of the cut-elimination theorem