2 problems

Scott-set characterization of transcendence for countable recursively saturated models
Let $M$ be a countable recursively saturated model of $\mathrm{PA}$ , and let $\operatorname{SSy}(M)$ denote its standard system. Transcendence characterization conjecture. There is…
openmodels-of-arithmetic model-theory scott-sets
0 responses
05
Khoussainov's conjectures on quotient presentations of nonstandard arithmetic models
Khoussainov's conjectures. (1) No nonstandard model of arithmetic admits a computable quotient presentation by a computably enumerable equivalence relation on the natural numbers.…
opencomputable-model-theory computable-structures models-of-arithmetic
0 responses
03

Scott-set characterization of transcendence for countable recursively saturated models