W.W. Tait. Normal form theorem for bar recursive functions of finite type. In Proceedings of the second Scandinavian Logic Symposium, J.E. Fenstad ed., North Holland, Amsterdam, 1971, pp. 353-367. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On the computational content of the Axiom of Choice - Berardi, Bezem, Coquand (1995) (8 citations) (Correct)
....and completes the proof of the lemma. 2 Using the lemma above we can prove by contradiction that Phi P H [ realizes . We give an informal argument, which can easily be formalized using the axiom of Dependent Choice and classical logic. The argument is similar to the argument used by Tait in [22]. Suppose Phi P H [ does not realize . Then, by the lemma above, there exist X 1 ; Y 1 ; Z 1 such that [ X 1 ; Y 1 ; Z 1 ) satisfies the conditions of the lemma, in particular Phi P H [ X 1 ; Y 1 ; Z 1 ) does not realize . Applying the lemma again yields X 2 ; Y 2 ; Z 2 such that : ....
W.W. Tait. Normal form theorem for bar recursive functions of finite type. In Proceedings of the second Scandinavian Logic Symposium, J.E. Fenstad ed., North Holland, Amsterdam, 1971, pp. 353-367.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC