Computable transformations of structures

DOI10.1007/978-3-319-58741-7_9MaRDI QIDQ2011638zbMATH OpenOpenAlexFDO

Authors Russell Miller

Publication date 4 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-58741-7_9

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Recommendations

• Isomorphism relations on computable structures
• Comparing Classes of Finite Structures
• The isomorphism problem for classes of computable fields
• ISOMORPHISM ON HYP
• The isomorphism problem for computable Abelian _p-groups of bounded length

Cites work

• A Borel reductibility theory for classes of countable structures
• A computable functor from graphs to fields
• Categoricity properties for computable algebraic fields
• Classification from a Computable Viewpoint
• Comparing Classes of Finite Structures
• Computable functors and effective interpretability
• Finitary reducibility on equivalence relations
• On strongly minimal sets
• The isomorphism problem for classes of computable fields
• Turing computable embeddings

Cited in

(11)

• The computable embedding problem
• Isomorphism of abstract knowledge decompositions
• Computable isomorphisms for certain classes of infinite graphs
• Comparing Classes of Finite Structures
• scientific article; zbMATH DE number 3898912 (Why is no real title available?)
• Isomorphisms and algorithmic properties of structures with two equivalences
• Transformation of algorithms written in the form of composition schemes
• Classes of structures with no intermediate isomorphism problems
• Scalability and the isomorphism problem
• ISOMORPHISM ON HYP
• scientific article; zbMATH DE number 3977003 (Why is no real title available?)

This page was built for publication: Computable transformations of structures

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