8 Jun
2005
8 Jun
'05
2:01 p.m.
Galchin Vasili wrote:
Hello,
Let G be a directed graph that either has an infinite # of nodes or has edges which are loops.
Would a constructist recognize the existence of G's free category?
<disclaimer> IAMNOT ="constructivist, logician", BUT </disclaimer> The free category consists of finite sequences of choices from an infinite set of edges; this does not require the axiom of choice, assuming the edges of the graph themselves to be constructively well-defined. Constructivists would have trouble with the "opposite" case in which infinitely many independent choices were required, even if each choice was between only finitely many options (but more than one). -Robert Dawson