تقرير
Computably Categorical Fields via Fermat's Last Theorem
| العنوان: | Computably Categorical Fields via Fermat's Last Theorem |
|---|---|
| المؤلفون: | Miller, Russell, Schoutens, Hans |
| المصدر: | Computability 2 (2013), 51-65 |
| سنة النشر: | 2012 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Logic, Computer Science - Logic in Computer Science, 03C57 (Primary), 03D45, 12L05 (Secondary) |
| الوصف: | We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically computable (infinite) transcendence basis. Comment: to appear in the journal Computability |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1212.6751 |
| رقم الأكسشن: | edsarx.1212.6751 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |