Computable transformations of structures

DOI10.1007/978-3-319-58741-7_9zbMATH Open1433.03085OpenAlexW2612747265MaRDI QIDQ2011638FDOQ2011638

Authors: Russell Miller 

Publication date: 4 August 2017

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

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

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

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

Cited In (10)

• The computable embedding problem
• Isomorphism of abstract knowledge decompositions
• Computable isomorphisms for certain classes of infinite graphs
• Comparing Classes of Finite Structures
• Title not available (Why is that?)
• 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
• ISOMORPHISM ON HYP
• Title not available (Why is that?)

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)