CODING IN GRAPHS AND LINEAR ORDERINGS

DOI10.1017/jsl.2019.91zbMath1459.03046arXiv1903.06948OpenAlexW3098534012MaRDI QIDQ5148104

S. Vatev, Alexandra Soskova, Julia F. Knight

Publication date: 29 January 2021

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

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

zbMATH Keywords

graphTuring computable embeddinglinear orderingseffective interpretationTuring operatorMedvedev's reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

THE TREE OF TUPLES OF A STRUCTURE ⋮ Classes of algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• The jump operation for structure degrees
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Undecidable fragments of elementary theories
• A jump inversion theorem for the semilattices of \(\Sigma\)-degrees
• Algorithmic reducibilities of algebraic structures
• A Borel reductibility theory for classes of countable structures
• A computable ℵ₀-categorical structure whose theory computes true arithmetic
• Notes on the Jump of a Structure
• A Jump Inversion Theorem for the Degree Spectra
• Degrees coded in jumps of orderings
• Stability of nilpotent groups of class 2 and prime exponent
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• Degrees of Structures
• Model Theory
• THE TREE OF TUPLES OF A STRUCTURE
• Turing computable embeddings
• Comparing Classes of Finite Structures
• An interpolation theorem for denumerably long formulas
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

This page was built for publication: CODING IN GRAPHS AND LINEAR ORDERINGS