A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
Fried and Kollár constructed a fully faithful functor from the category of graphs to the category of fields. We give a new construction of such a functor and use it to resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S, there e...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press (CUP),
2018-06-04T15:04:36Z.
|
| Subjects: | |
| Online Access: | Get fulltext |