Classifications of computable structures
type: Item
instance of: scholarly article
title: Classifications of computable structures
zbMATH Open document ID: 1455.03044
DOI: 10.1215/00294527-2017-0015
author: Karen Lange
author: Rebecca M. Steiner
author: Russell Miller
published in: Notre Dame Journal of Formal Logic
publication date: 2018-03-08T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.ndjfl/1498788255
full work available at URL: https://repository.wellesley.edu/scholarship/127
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 6848190
zbMATH Keywords: Friedberg enumeration
zbMATH Keywords: computable structure theory
zbMATH Keywords: equivalence structure
zbMATH Keywords: effective classification
MaRDI profile type: Publication
OpenAlex ID: W2536983125
cites work: Computable structures and the hyperarithmetical hierarchy
cites work: Effective categoricity of equivalence structures
cites work: Index sets of computable structures
cites work: Classification from a Computable Viewpoint
cites work: Every Set has a Least Jump Enumeration
cites work: Theorie Der Numerierungen III
cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
cites work: Spectra of Algebraic Fields and Subfields
cites work: Q4451633
cites work: Q4677692
cites work: Degree spectra and computable dimensions in algebraic structures
cites work: d-computable categoricity for algebraic fields
cites work: Computable categoricity for algebraic fields with splitting algorithms
cites work: Computable Algebra, General Theory and Theory of Computable Fields
cites work: Q3819052
cites work: Effective algebraicity
description: scientific article; zbMATH DE number 6848190