19th Annual IEEE Symposium on Logic in Computer Science (LICS'04) The Omega Rule is II_2^0-Hard in the λβ-Calculus Turku, Finland July 13-July 17 ISBN: 0-7695-2192-4
We give a many-one reduction of the set of true II_2^0 sentences to the set of consequences of the lambda calculus with the omega rule. This solves in the affirmative a well known problem of H. Barendregt. The technique of proof has interest in itself and can be extended to prove that the theory which identifies all unsolvable terms together with the omega rule is II_1^1-complete which solves another long-standing conjecture of H. Barendregt.
Citation:
Benedetto Intrigila, Richard Statman, "The Omega Rule is II_2^0-Hard in the λβ-Calculus," lics, pp.202-210, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb