Isomorphism of Computable Structures and Vaught's Conjecture

DOI10.2178/JSL.7804180MaRDI QIDQ5407056zbMATH OpenOpenAlexWikidataFDO

Authors Howard Becker

Publication date 4 April 2014

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.jsl/1388954009

Mathematics Subject Classification ID

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

Recommendations

• Isomorphism relations on computable structures
• Isometries and computability structures
• On the isomorphism problem for some classes of computable algebraic structures
• The isomorphism problem for classes of computable fields
• Isomorphisms and definable relations on computable models
• Generically and coarsely computable isomorphisms
• On isomorphism classes of computably enumerable equivalence relations
• A computability theoretic equivalent to Vaught's conjecture
• scientific article; zbMATH DE number 2047478
• Computable isomorphisms of distributive lattices

Cited in

(8)

• A computability theoretic equivalent to Vaught's conjecture
• Using computability to measure complexity of algebraic structures and classes of structures
• Some dichotomy theorems for isomorphism relations of countable models
• Comparing classes of finite sums
• ISOMORPHISM ON HYP
• Strange structures from computable model theory
• Assigning an isomorphism type to a hyperdegree
• The isomorphism problem for classes of computable fields

This page was built for publication: Isomorphism of Computable Structures and Vaught's Conjecture

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