4 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
Thomas Powell
We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is…