8 Jun
2005
8 Jun
'05
2:22 p.m.
At 14:00 -0700 6/6/05, 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?
Bill, In general, constructionists would have trouble with any completed infinite set. In this context, completed means that we have a list of all the elements. This is different that the situation wherein I can generate as many elements as I want (Peano axioms) but they must be built on one another. I can't speak to the "loops" part. -- best, steve Dr. D. E. Stevenson Director, Institute for Modeling and Simulation Applications Clemson University Clemson,SC 29634-0974