A non-topological proof for the impossibility of k-set agreement

In the k-set agreement task, each process proposes a value and each correct process has to decide a value which was proposed, so that at most k distinct values are decided. Using topological arguments it has been proved that k-set agreement is unsolvable in the asynchronous wait-free read/write shared memory model, when k