Degree spectra and computable dimensions in algebraic structures

DOI10.1016/S0168-0072(01)00087-2zbMATH Open1016.03034OpenAlexW1996816738WikidataQ61586383 ScholiaQ61586383MaRDI QIDQ1612482FDOQ1612482

Authors: Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii Slinko 

Publication date: 22 August 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(01)00087-2

Recommendations

• Degree Spectra of Relations on Computable Structures
• Turing degrees of isomorphism types of algebraic objects
• Degree spectra of relations on structures of finite computable dimension
• scientific article; zbMATH DE number 1984268
• scientific article; zbMATH DE number 5066582

zbMATH Keywords

computable dimensioncomputable structurecomputable algebradegree spectrumrecursive modelinterpretation of structurenonstructure theorems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Autostability of models
• Strong and weak constructivization and computable families
• Nilpotent groups of finite algorithmic dimension
• A Borel reductibility theory for classes of countable structures
• Effective content of field theory
• Recursively Categorical Linear Orderings
• Problem of the number of non-self-equivalent constructivizations
• Title not available (Why is that?)
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Borel equivalence relations and classifications of countable models
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• New Directions in Descriptive Set Theory
• Recursive categoricity and persistence
• Title not available (Why is that?)
• Degrees coded in jumps of orderings
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• Title not available (Why is that?)
• The completeness of the isomorphism relation for countable Boolean algebras
• Title not available (Why is that?)
• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
• Stability of nilpotent groups of class 2 and prime exponent
• Computably categorical structures and expansions by constants
• Title not available (Why is that?)
• The quantity of nonautoequivalent constructivizations
• On a correspondence between rings and groups
• Degree spectra of relations on structures of finite computable dimension
• The possible Turing degree of the nonzero member in a two element degree spectrum
• Computable isomorphisms, degree spectra of relations, and Scott families
• A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• On the effective universality of mereological theories
• New degree spectra of Polish spaces
• Categoricity of computable infinitary theories
• Some Questions in Computable Mathematics
• The computable embedding problem
• Equivalence Relations on Classes of Computable Structures
• Computability-theoretic categoricity and Scott families
• Complexity of the problem of being equivalent to Horn formulas
• Strength and weakness in computable structure theory
• A computable functor from graphs to fields
• Algebraic aspects of the computably enumerable degrees.
• The index set of the groups autostable relative to strong constructivizations
• Degree spectra of structures relative to equivalences
• Degrees of categoricity and spectral dimension
• Analytic computable structure theory and \(L^p\) spaces
• On Constructive Nilpotent Groups
• Degree spectra of real closed fields
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Categoricity spectra of computable structures
• Effective categoricity for distributive lattices and Heyting algebras
• Degrees of non-computability of homeomorphism types of Polish spaces
• Computable abelian groups
• Using computability to measure complexity of algebraic structures and classes of structures
• On degree spectra of topological spaces
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Categoricity properties for computable algebraic fields
• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Constructing decidable graphs from decidable structures
• Π₁¹ relations and paths through
• Degree Spectra of Relations on Computable Structures
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
• Computable structures and operations on the space of continuous functions
• Computable procedures for fields
• Preserving categoricity and complexity of relations
• THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
• Degree spectra of relations on structures of finite computable dimension
• \(d\)-computable categoricity for algebraic fields
• Spectra of theories and structures
• Computable functors and effective interpretability
• Index sets for some classes of structures
• A \(\Delta^{0}_{2}\)-poset with no positive presentation
• Computability of distributive lattices
• Computability of Fraïssé limits
• There is no classification of the decidably presentable structures
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• The complexity of central series in nilpotent computable groups
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Torsion-free abelian groups with optimal Scott families
• Degree spectra of structures
• Turing degrees of nonabelian groups
• Finitely generated groups are universal among finitely generated structures
• Measuring complexities of classes of structures
• On the complexity of the successivity relation in computable linear orderings
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• Title not available (Why is that?)
• Simple structures with complex symmetry
• Degrees of isomorphism types and countably categorical groups
• Classifications of computable structures
• Limitwise monotonic sequences and degree spectra of structures
• Computable categoricity of trees of finite height
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Point Degree Spectra of Represented Spaces
• Degrees of categoricity of computable structures
• Categoricity spectra for polymodal algebras
• Computability theory. Abstracts from the workshop held January 7--13, 2018
• Spectral universality of linear orders with one binary relation
• A Friedberg enumeration of equivalence structures
• Computable isomorphisms of Boolean algebras with operators
• The theory of projective planes is complete with respect to degree spectra and effective dimensions
• Uniform procedures in uncountable structures
• Isomorphisms, definable relations, and Scott families for integral domains and commutative semigroups
• INTERPRETING A FIELD IN ITS HEISENBERG GROUP
• Title not available (Why is that?)
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Degrees of and lowness for isometric isomorphism
• COPYING ONE OF A PAIR OF STRUCTURES
• Limitwise monotonic spectra and their generalizations
• Lowness for isomorphism, countable ideals, and computable traceability
• HKSS-completeness of modal algebras
• Some new computable structures of high rank
• Computable Heyting algebras with distinguished atoms and coatoms
• Weak truth table degrees of structures
• Theory spectra and classes of theories
• Non-density in punctual computability
• \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes
• On two types of concept lattices in the theory of numberings
• Graphs are not universal for online computability
• Categorical linearly ordered structures
• Model completeness and relative decidability
• Freely generated projective planes with finite computable dimension
• Computable embeddings for pairs of linear orders
• Prime models of finite computable dimension
• On functors enumerating structures
• A note on computable embeddings for ordinals and their reverses
• \(\Sigma\)-presentations of the ordering on the reals
• Categoricity and complexity of relations over algebraic structures
• A directed graph of finite \(\Delta^0_{\alpha}\)-dimension
• A structure of punctual dimension two

This page was built for publication: Degree spectra and computable dimensions in algebraic structures

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