The tree of tuples of a structure

DOI10.1017/JSL.2019.92MaRDI QIDQ5070461zbMATH OpenOpenAlexFDO

Authors Matthew Harrison-Trainor, Antonio Montalbán

Publication date 12 April 2022

Published in 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)

Recommendations

• The computable dimension of trees of infinite height
• The Computable Dimension of I-Trees of Infinite Height
• scientific article; zbMATH DE number 1696443
• Classifications of computable structures
• Enumerations, countable structures and Turing degrees

Cites work

• scientific article; zbMATH DE number 890268 (Why is no real title available?)
• A Borel reductibility theory for classes of countable structures
• A computable functor from graphs to fields
• A fixed point for the jump operator on structures
• Algorithmic reducibilities of algebraic structures
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Computability theoretic classifications for classes of structures
• Computable Structure Theory
• Computable functors and effective interpretability
• Degrees coded in jumps of orderings
• Enumeration Degrees and Enumerability of Familes
• Enumerations in computable structure theory
• Reducibility on families
• The complexity of computable categoricity

Cited in

(4)

• The tree structure in staircase tableaux
• Classes of algebraic structures
• scientific article; zbMATH DE number 109220 (Why is no real title available?)
• CODING IN GRAPHS AND LINEAR ORDERINGS

This page was built for publication: The tree of tuples of a structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070461)