THE TREE OF TUPLES OF A STRUCTURE

DOI10.1017/jsl.2019.92zbMath1504.03024OpenAlexW3084054483MaRDI QIDQ5070461

Matthew Harrison-Trainor, Antonio Montalbán

Publication date: 12 April 2022

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

Full work available at URL: https://doi.org/10.1017/jsl.2019.92

zbMATH Keywords

codingcomputable structure theoryback-and-forth

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Classes of algebraic structures ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS

Cites Work

• Unnamed Item
• Unnamed Item
• Reducibility on families
• The complexity of computable categoricity
• Enumerations in computable structure theory
• Algorithmic reducibilities of algebraic structures
• A Borel reductibility theory for classes of countable structures
• Enumeration Degrees and Enumerability of Familes
• Degrees coded in jumps of orderings
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Computable Structure Theory
• CODING IN GRAPHS AND LINEAR ORDERINGS
• A fixed point for the jump operator on structures
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

This page was built for publication: THE TREE OF TUPLES OF A STRUCTURE