Degree spectra and computable dimensions in algebraic structures
type: Item
instance of: scholarly article
title: Degree spectra and computable dimensions in algebraic structures
zbMATH Open document ID: 1016.03034
DOI: 10.1016/S0168-0072(01)00087-2
author: Denis R. Hirschfeldt
author: Bakhadyr Khoussainov
author: Richard A. Shore
author: Arkadii Slinko
published in: Annals of Pure and Applied Logic
publication date: 2002-08-22T00:00:00Z
review text: The authors suggest methods to define directed graphs in some classes of structures like symmetric, irreflexive graphs, partial orderings, lattices, rings, integral domains, commutative semigroups, 2-step nilpotent groups in a way that enables them to uniformly transfer to models of these classes a series of known computability-theoretic results on degree spectra, on the number of non-computably isomorphic presentations, etc.
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 1787753
zbMATH Keywords: computable structure
zbMATH Keywords: computable dimension
zbMATH Keywords: computable algebra
zbMATH Keywords: degree spectrum
zbMATH Keywords: nonstructure theorems
zbMATH Keywords: interpretation of structure
zbMATH Keywords: recursive model
Wikidata QID: Q61586383
reviewed by: Andrei S. Morozov
MaRDI profile type: Publication
cites work: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
cites work: Q3919698
cites work: The completeness of the isomorphism relation for countable Boolean algebras
cites work: Computably categorical structures and expansions by constants
cites work: Q4513967
cites work: Handbook of recursive mathematics. Vol. 1: Recursive model theory
cites work: A Borel reductibility theory for classes of countable structures
cites work: The quantity of nonautoequivalent constructivizations
cites work: Problem of the number of non-self-equivalent constructivizations
cites work: Q3961013
cites work: Q3331204
cites work: Q3130249
cites work: Autostability of models
cites work: Nilpotent groups of finite algorithmic dimension
cites work: The possible Turing degree of the nonzero member in a two element degree spectrum
cites work: Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
cites work: Degree spectra of relations on structures of finite computable dimension
cites work: A computably categorical structure whose expansion by a constant has infinite computable dimension
cites work: Borel equivalence relations and classifications of countable models
cites work: Q4003410
cites work: New Directions in Descriptive Set Theory
cites work: Computable isomorphisms, degree spectra of relations, and Scott families
cites work: Q4938557
cites work: A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
cites work: Degrees coded in jumps of orderings
cites work: Q5287502
cites work: On a correspondence between rings and groups
cites work: Stability of nilpotent groups of class 2 and prime exponent
cites work: Effective content of field theory
cites work: Recursive categoricity and persistence
cites work: Strong and weak constructivization and computable families
cites work: Q4895324
cites work: Recursively Categorical Linear Orderings
cites work: Q4317890
cites work: Relative to any nonrecursive set
cites work: Q4040892
cites work: Enumerations, countable structures and Turing degrees
full work available at URL: s0168-0072(01)00087-2
OpenAlex ID: W1996816738
description: scientific article; zbMATH DE number 1787753