Timeline for Non-Archimedean non-standard models for R
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 18, 2012 at 12:19 | vote | accept | Dave | ||
Apr 18, 2012 at 12:19 | comment | added | Dave | Yes, indeed. I think that a good solution for that would include adding another constant c to the language, then the theorems c>1, c>1+1 and so on, find a model and "forget" c (this is a model of the reduced language). Thanks! | |
Apr 18, 2012 at 12:15 | comment | added | Ramiro de la Vega | No, that doesn´t work. You first need to add a constant to the language. | |
Apr 18, 2012 at 12:13 | comment | added | Dave | Thanks for your answer. I'm afraid I don't understand how compactness comes in here. I'm guessing I should add the statements $\exists{x} x>1$, $\exists{x} x>1+1$ and so on to my set, and show that there are models that satisfy that set. But I think it only gives me that there are greater elements than any element of the type $1+1+\ldots+1$; I need one element that "covers them all". | |
Apr 18, 2012 at 12:09 | history | answered | Ramiro de la Vega | CC BY-SA 3.0 |