Related papers: A Computable Functor From Graphs to Fields
We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
For a nice-enough category $\mathcal{C}$, we construct both the morphism category ${\rm H}(\mathcal{C})$ of $\mathcal{C}$ and the category ${\rm mod}\mbox{-}\mathcal{C}$ of all finitely presented contravariant additive functors over…
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…
We give an introduction to constructive category theory by answering two guiding computational questions. The first question is: how do we compute the set of all natural transformations between two finitely presented functors like…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
Category theory provides a collective description of many arrangements in mathematics, such as topological spaces, Banach spaces and game theory. Within this collective description, the perspective from any individual member of the…
We adapt the classical notion of learning from text to computable structure theory. Our main result is a model-theoretic characterization of the learnability from text for classes of structures. We show that a family of structures is…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors…
We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to…
The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a…
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…
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…
The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
Based on Gandy's principles for models of computation we give category-theoretic axioms describing locally deterministic updates to finite objects. Rather than fixing a particular category of states, we describe what properties such a…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…