加载中…
We prove that (additive) ordered group reducts of nonstandard models of the bounded arithmetical theory are recursively saturated in a rich language with predicates expressing the integers, rationals, and logarithmically bounded numbers. Combined with our previous results on the construction of the real exponential function on completions of models of , we show that every countable model of is an exponential integer part of a real-closed exponential field.

生成讲解博客的中文版本

生成AI智能校验的中文版本