Isomorphism and classification for countable structures

DOI10.3233/COM-180095MaRDI QIDQ5211056zbMATH OpenOpenAlexFDO

Authors Russell Miller

Publication date 17 January 2020

Published in Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.02506

zbMATH Keywords

classificationmeasurecomputabilitycomputable categoricitycomputable structure theoryalgebraic fields

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Abstract: We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and computable structure theory, extending concepts from the latter beyond computable structures to examine the isomorphism problem on arbitrary countable structures. We give examples using specific classes of fields and of trees, illustrating how the new concepts can yield classifications that reveal differences between seemingly similar classes. Finally, we use a computable homeomorphism to define a measure on the space of isomorphism types of algebraic fields, and examine the prevalence of relative computable categoricity under this measure.

Recommendations

• Classifications of computable structures
• The isomorphism problem for classes of computable fields
• Classification from a Computable Viewpoint
• The relation of recursive isomorphism for countable structures
• Isomorphism relations on computable structures

Cited in

(13)

• Isomorphism between two-type ordinals and well-ordered two-type class structures
• Non-coding enumeration operators
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Computable procedures for fields
• A classification of orbits admitting a unique invariant measure
• A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF
• Computable embeddings for pairs of linear orders
• Classes of structures with no intermediate isomorphism problems
• scientific article; zbMATH DE number 57367 (Why is no real title available?)
• Forcing isomorphism
• Structure of iso-scalar sets
• Classifications of computable structures
• Computability theory. Abstracts from the workshop held January 7--13, 2018

This page was built for publication: Isomorphism and classification for countable structures

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