We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback