Dragonfall
- 1,023
- 5
I've been told that non-well-founded sets can be used to model nonstandard analysis, but I can't find any literature on the subject. Does anyone know where I can find it?
The discussion centers around the use of non-well-founded sets in modeling nonstandard analysis (NSA). Participants explore the theoretical implications, literature references, and the conditions under which non-well-foundedness may or may not be necessary for NSA, including considerations of membership chains and the structure of models.
Participants express differing views on the necessity and implications of non-well-founded sets in NSA. While some reference literature supporting their claims, others question the relevance and necessity of these concepts, indicating that the discussion remains unresolved.
Participants note limitations in the Wikipedia article's coverage of NSA and its logical foundations, suggesting that it does not adequately address recent work or broader axiomatic frameworks.
My best guess at what you mean is the following...Dragonfall said:I've been told that non-well-founded sets can be used to model nonstandard analysis, but I can't find any literature on the subject. Does anyone know where I can find it?
Dragonfall said:I've been told that non-well-founded sets can be used to model nonstandard analysis, but I can't find any literature on the subject. Does anyone know where I can find it?
Hurkyl said:My best guess at what you mean is the following...
First see this section of Wikipedia's article on NSA.
In order to do "ordinary" NSA, no non-well-foundedness is needed. Note that what they denote as V is actually [itex]V_\omega[/itex].
As I understand it, a problem occurs only when you consider unbounded formulae, or if you want to work in some [itex]V_\alpha[/itex] with [itex]\alpha > \omega[/itex]. In order to do either of these, you must assume some version of anti-foundation.
There's no problem with [itex]x_1[/itex] being untyped?gulliput said:Every nonstandard model IS non-wellfounded "in the standard sense" - if it is countably saturated ("a minimal requirement" for doing NSA) then there are infinitely descending 'membership chains' - [itex]x_1\ni x2 \ni \ldots[/itex]
Hurkyl said:There's no problem with [itex]x_1[/itex] being untyped?
Or, I suppose a more accurate question is whether requiring constants to be typed eliminates this issue.
Dragonfall said:I've read the section from Wikipedia and I can't see why we should evoke non-well-founded sets or use V_a for a greater than omega.