Computer Science – Logic in Computer Science
Scientific paper
2006-09-14
LMCS 2 (4:5) 2006
Computer Science
Logic in Computer Science
17 pages
Scientific paper
10.2168/LMCS-2(4:5)2006
H is the theory extending β-conversion by identifying all closed
unsolvables. Hω is the closure of this theory under the ω-rule
(and β-conversion). A long-standing conjecture of H. Barendregt states
that the provable equations of Hω form
Π11-complete set. Here we prove that conjecture.
Intrigila Benedetto
Statman Richard
No associations
LandOfFree
Solution of a Problem of Barendregt on Sensible lambda-Theories does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Solution of a Problem of Barendregt on Sensible lambda-Theories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solution of a Problem of Barendregt on Sensible lambda-Theories will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-537415