COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
From MaRDI portal
Publication:5738191
DOI10.1017/jsl.2016.12zbMath1390.03034arXiv1506.02737OpenAlexW2963736300MaRDI QIDQ5738191
Antonio Montalbán, Alexander G. Melnikov, Matthew Harrison-Trainor, Russell G. Miller
Publication date: 1 June 2017
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02737
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (31)
DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Computable valued fields ⋮ On functors enumerating 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 ⋮ Jump inversions of algebraic structures and Σ‐definability ⋮ A structure of punctual dimension two ⋮ Some Questions in Computable Mathematics ⋮ Degree spectra of real closed fields ⋮ Some new computable structures of high rank ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ HKSS-completeness of modal algebras ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Computability of distributive lattices ⋮ BOREL FUNCTORS AND INFINITARY INTERPRETATIONS ⋮ Finitely generated groups are universal among finitely generated structures ⋮ Computable transformations of structures ⋮ Turing computable embeddings, computable infinitary equivalence, and linear orders ⋮ Degree spectra of structures ⋮ Model completeness and relative decidability ⋮ Computable embeddings for pairs of linear orders ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Categorical linearly ordered structures ⋮ A Computable Structure with Non-Standard Computability ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY ⋮ A note on computable embeddings for ordinals and their reverses ⋮ Positive enumerable functors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relations between algorithmic reducibilities of algebraic systems
- Generic copies of countable structures
- Degree spectra and computable dimensions in algebraic structures
- Rice sequences of relations
- On Σ‐definability without equality over the real numbers
- Degrees of presentability of structures. I
- Degrees of presentability of structures. II
- Notes on the Jump of a Structure
- Computable Ordered Abelian Groups and Fields
- A Jump Inversion Theorem for the Degree Spectra
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Model Theory
- A fixed point for the jump operator on structures
- Effective model theory vs. recursive model theory
This page was built for publication: COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
