Solution of a Problem of Barendregt on Sensible lambda-Theories

DOI10.2168/LMCS-2(4:5)2006MaRDI QIDQ5310670zbMATH OpenOpenAlexFDO

Authors Benedetto Intrigila, Richard Statman

Publication date 11 October 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-2(4:5)2006

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40)

Recommendations

• The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
• The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus
• Some results on extensionality in lambda calculus
• Solution to the range problem for combinatory logic
• Graph lambda theories

Cited in

(6)

• Some results on extensionality in lambda calculus
• Solution to the range problem for combinatory logic
• The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
• The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus
• scientific article; zbMATH DE number 956467 (Why is no real title available?)
• Addressing machines as models of \(\lambda\)-calculus

This page was built for publication: Solution of a Problem of Barendregt on Sensible lambda-Theories

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