The tree of tuples of a structure

DOI10.1017/JSL.2019.92zbMATH Open1504.03024OpenAlexW3084054483MaRDI QIDQ5070461FDOQ5070461

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

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

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)

Cites Work

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

Cited In (4)

• The tree structure in staircase tableaux
• Classes of algebraic structures
• Title not available (Why is that?)
• 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)