Browsing Department of Informatics by Subject "Finite Sets"
Now showing items 1-1 of 1
(Dagstuhl Publishing, 2015)In this paper we look at streamless sets, recently investigated by Coquand and Spiwack. A set is streamless if every stream over that set contain a duplicate. It is an open question in constructive mathematics whether the ...Conference object