Isomorphisms and definable relations on computable models

zbMATH Open1157.03012MaRDI QIDQ5457380FDOQ5457380

Authors: S. S. Goncharov 

Publication date: 14 April 2008

Recommendations

• Isomorphism relations on computable structures
• scientific article; zbMATH DE number 1984268
• Computability-Theoretic Complexity of Countable Structures
• Computability and computable models
• Computable isomorphisms, degree spectra of relations, and Scott families

zbMATH Keywords

surveycomputable categoricitycomputable structuresalgorithmic complexityScott rank\(\Pi_1^1\)-definability

Mathematics Subject Classification ID

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

Cited In (6)

• Coding and definability in computable structures
• Isomorphism of Computable Structures and Vaught's Conjecture
• The isomorphism property versus the special model axiom
• Isomorphisms and algorithmic properties of structures with two equivalences
• Title not available (Why is that?)
• Categoricity and complexity of relations over algebraic structures

This page was built for publication: Isomorphisms and definable relations on computable models

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