Classifications of computable structures

DOI10.1215/00294527-2017-0015zbMath1455.03044OpenAlexW2536983125MaRDI QIDQ1704081

Rebecca M. Steiner, Karen Lange, Russell G. Miller

Publication date: 8 March 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1498788255

zbMATH Keywords

computable structure theoryeffective classificationequivalence structureFriedberg enumeration

Mathematics Subject Classification ID

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

Related Items (3)

Enumerating abelian \(p\)-groups ⋮ A Friedberg enumeration of equivalence structures ⋮ Classifications of definable subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Effective algebraicity
• Effective categoricity of equivalence structures
• Every Set has a Least Jump Enumeration
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Classification from a Computable Viewpoint
• Index sets of computable structures
• Spectra of Algebraic Fields and Subfields
• d-computable categoricity for algebraic fields
• Theorie Der Numerierungen III
• Computable categoricity for algebraic fields with splitting algorithms
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: Classifications of computable structures