A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
A computational interpretation of open induction
2004
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
We study the proof-theoretic and computational properties of open induction, a principle which is classically equivalent to Nash-Williams' minimal-bad-sequence argument and also to (countable) dependent choice (and hence contains full classical analysis). We show that, intuitionistically, open induction and dependent choice are quite different: Unlike dependent choice, open induction is closed under negative-and -translation, and therefore proves the same ¡ £ ¢ ¤ -formulas (over not necessarily
doi:10.1109/lics.2004.1319627
dblp:conf/lics/Berger04
fatcat:aihxty33a5evzetc57jlzwbiz4