A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS

DOI10.1017/jsl.2017.50zbMath1447.03005arXiv1510.07322OpenAlexW2964092600MaRDI QIDQ4638989

Hans Schoutens, Bjorn Poonen, Alexandra Shlapentokh, Russell G. Miller

Publication date: 2 May 2018

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07322

zbMATH Keywords

fieldscompletenessgraphsfunctorcomputabilitycomputable model theory

Mathematics Subject Classification ID

Special properties of functors (faithful, full, etc.) (18A22) Automorphisms and endomorphisms of algebraic structures (08A35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of fields (12L12)

Related Items (38)

\(\prod_1^1\)-completeness of the computable categoricity problem for projective planes ⋮ DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ There is no classification of the decidably presentable structures ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Freely generated projective planes with finite computable dimension ⋮ On functors enumerating structures ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Preserving categoricity and complexity of relations ⋮ COPYING ONE OF A PAIR OF STRUCTURES ⋮ INTERPRETING A FIELD IN ITS HEISENBERG GROUP ⋮ Graphs are not universal for online computability ⋮ Spectral universality of linear orders with one binary relation ⋮ On the effective universality of mereological theories ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Classes of algebraic structures ⋮ A structure of punctual dimension two ⋮ Some Questions in Computable Mathematics ⋮ Degree spectra of real closed fields ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ HKSS-completeness of modal algebras ⋮ Categoricity spectra for polymodal algebras ⋮ Finitely generated groups are universal among finitely generated structures ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY ⋮ Primitive recursive fields and categoricity ⋮ Computable transformations of structures ⋮ Categoricity spectra of computable structures ⋮ Degree spectra of structures ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Model completeness and relative decidability ⋮ Constructing decidable graphs from decidable structures ⋮ Computable embeddings for pairs of linear orders ⋮ Categoricity properties for computable algebraic fields ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY ⋮ A note on computable embeddings for ordinals and their reverses ⋮ Computable procedures for fields ⋮ Positive enumerable functors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computable categoricity
• Degrees of orderings not isomorphic to recursive linear orderings
• Integral points on curves
• Autostability of models
• Problem of the number of non-self-equivalent constructivizations
• The quantity of nonautoequivalent constructivizations
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Varieties without extra automorphisms. III: Hypersurfaces
• Bounds on the number of automorphisms of curves over algebraically closed fields
• Simple structures with complex symmetry
• Complements à un article de Hans Grauert sur la conjecture de Mordell
• Degrees of categoricity of computable structures
• Computably Categorical Fields via Fermat’s Last Theorem
• Does the Frobenius endomorphism always generate a direct summand in the endomorphism monoids of fields of prime characteristic?
• Computable categoricity of trees of finite height
• Spectra of structures and relations
• Non Σ_n axiomatizable almost strongly minimal theories
• d-computable categoricity for algebraic fields
• Degrees coded in jumps of orderings
• Recursively Categorical Linear Orderings
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Degrees of Structures
• Computable categoricity for algebraic fields with splitting algorithms
• Turing computable embeddings
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

This page was built for publication: A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS