An alternate proof of Statman's finite completeness theorem

DOI10.1016/J.IPL.2012.04.014zbMATH Open1243.03017OpenAlexW2273291048MaRDI QIDQ436624FDOQ436624

Igor Walukiewicz, B. Srivathsan

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.014

zbMATH Keywords

theory of computationformal semanticssimply typed lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• Completeness in the theory of types
• Recognizability in the Simply Typed Lambda-Calculus
• Completeness, invariance and λ-definability
• The Clausal Theory of Types
• On the membership problem for non-linear abstract categorial grammars

Cited In (3)

• The IO and OI hierarchies revisited
• Statman's 1-section theorem
• A brief proof of the full completeness of Shin's Venn diagram proof system

This page was built for publication: An alternate proof of Statman's finite completeness theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436624)