N is not always closed, and that, more generally, the union of a closed set and a II n 0-set is not always II n+10. In the proof of this fact we make use of the intuitionistic Borel Hierarchy Theorem, established in (Veldman, 1981) and (Veldman, 2001a)." /> On the persistent difficulty of disjunction - Veldman Wim | sdvig press

On the persistent difficulty of disjunction

Wim Veldman

pp. 77-90


This document is unfortunately not available for download at the moment.

Not implemented yet !