Infintesimals in a Recursively Enumerable Prime Model
classification
🧮 math.LO
keywords
enumerablefindmethodsmodelrecursivelyalgebraicbezoutcomplete
read the original abstract
Using methods developed by Robinson, we find a complete theory suitable for a first order description of infintesimal neighborhoods. We use this to construct a specialisation having universal properties and to find a recursively enumerable model in which the algebraic version of Bezout's theorem is provable by non-standard methods.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.