Quote from nitro:
Oh yes. It was just a quote from a book I am reading. I am more confident in FV today than ever.
I don't know if you just posted that randomly, but if you are suggesting that what I am attempting impossible due Godel's first theorem, I disagree. As pointed out by Wittgenstein, we can continue to build languages so that a problem becomes amenable in this FAS (Formal Axiomatic System) where it may be impossible to prove in some subset. A really beautiful example of this is the story of how Grothendieck invented etale cohomology to prove the Weil Conjectures.
Quote from nitro:
I don't know if you just posted that randomly, but if you are suggesting that what I am attempting impossible due Godel's first theorem, I disagree. As pointed out by Wittgenstein, we can continue to build languages so that a problem becomes amenable in this FAS (Formal Axiomatic System) where it may be impossible to prove in some subset. A really beautiful example of this is the story of how Grothendieck invented etale cohomology to prove the Weil Conjectures.
http://en.wikipedia.org/wiki/Étale_cohomology
Another is adding the Axiom of Choice to set theory:
http://en.wikipedia.org/wiki/Axiom_of_choice
Note in the article above statements like:
"...Grothendieck's use of these universes (whose existence cannot be proved in ZFC)..."
In any event, if true, it would be easier to map attempting a "FV" of SPX to the Halting Problem which is computer science version of Godel:
http://en.wikipedia.org/wiki/Halting_problem
Some would argue that "Technical Analysis" is this "language".
People horribly misunderstand Godel. In fact, it can be argued that much of the beauty of mathematics is a consequence of Godel's first theorem.
