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 …

In mathematics, we know there are some concepts-objects, constructions, structures, proofs-
that are more complex and difficult to describe than others. Computable structure theory …

§1. Introduction. 1.1. Our goal. Imagine your job is to receive—perhaps infinitely many— objects
of various sizes and pack Page 1 The Bulletin of Symbolic Logic Volume 25, Number 2, June …

Graphs are not universal for online computability - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

We introduce the notion of infinitary interpretation of structures. In general, an interpretation
between structures induces a continuous homomorphism between their automorphism …

This paper contributes to the general program which aims to eliminate an unbounded
search from proofs and procedures in computable structure theory. A countable structure in …

We describe punctual categoricity in several natural classes, including binary relational
structures and mono-unary functional structures. We prove that every punctually categorical …

Let $\operatorname {TFAb} _r $ be the class of torsion-free abelian groups of rank $ r $, and
let $\operatorname {FD} _r $ be the class of fields of characteristic $0 $ and transcendence …

Some Questions in Computable Mathematics | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …

Several researchers have recently established that for every Turing degree cc, the real
closed field of all c c-computable real numbers has spectrum {d: d'≥ c''\} d: d′≥ c′′. We …