Degree spectra and computable dimensions in algebraic structures
From MaRDI portal
Publication:1612482
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.
Recommendations
Cites work
- A Borel reductibility theory for classes of countable structures
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
- Autostability of models
- Borel equivalence relations and classifications of countable models
- Computable isomorphisms, degree spectra of relations, and Scott families
- Computably categorical structures and expansions by constants
- Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
- Degree spectra of relations on structures of finite computable dimension
- Degrees coded in jumps of orderings
- Effective content of field theory
- Enumerations, countable structures and Turing degrees
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 3863176 (Why is no real title available?)
- scientific article; zbMATH DE number 3732033 (Why is no real title available?)
- scientific article; zbMATH DE number 3781440 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 1531924 (Why is no real title available?)
- scientific article; zbMATH DE number 934778 (Why is no real title available?)
- scientific article; zbMATH DE number 1405578 (Why is no real title available?)
- scientific article; zbMATH DE number 233957 (Why is no real title available?)
- New Directions in Descriptive Set Theory
- Nilpotent groups of finite algorithmic dimension
- On a correspondence between rings and groups
- Problem of the number of non-self-equivalent constructivizations
- Recursive categoricity and persistence
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Recursively Categorical Linear Orderings
- Relative to any nonrecursive set
- Stability of nilpotent groups of class 2 and prime exponent
- Strong and weak constructivization and computable families
- The completeness of the isomorphism relation for countable Boolean algebras
- The possible Turing degree of the nonzero member in a two element degree spectrum
- The quantity of nonautoequivalent constructivizations
Cited in
(only showing first 100 items - show all)- Categoricity of computable infinitary theories
- Index sets for some classes of structures
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- Degree spectra of relations on structures of finite computable dimension
- Classifications of computable structures
- Computability theory. Abstracts from the workshop held January 7--13, 2018
- Degree spectra of real closed fields
- Computability-theoretic categoricity and Scott families
- Computability of distributive lattices
- A \(\Delta^{0}_{2}\)-poset with no positive presentation
- Simple structures with complex symmetry
- Finitely generated groups are universal among finitely generated structures
- Degree spectra of structures relative to equivalences
- Turing computable embeddings, computable infinitary equivalence, and linear orders
- Categoricity spectra of computable structures
- Degree spectra of structures
- Non-density in punctual computability
- Model completeness and relative decidability
- Computable embeddings for pairs of linear orders
- A note on computable embeddings for ordinals and their reverses
- Degrees of non-computability of homeomorphism types of Polish spaces
- Limitwise monotonic spectra and their generalizations
- Computable procedures for fields
- Complexity of the problem of being equivalent to Horn formulas
- Graphs are not universal for online computability
- Spectral universality of linear orders with one binary relation
- On degree spectra of topological spaces
- HKSS-completeness of modal algebras
- Using computability to measure complexity of algebraic structures and classes of structures
- Constructing decidable graphs from decidable structures
- Categorical linearly ordered structures
- \(\Sigma\)-presentations of the ordering on the reals
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Weak truth table degrees of structures
- The index set of the groups autostable relative to strong constructivizations
- Degrees of autostability for linear orders and linearly ordered abelian groups
- _1¹-completeness of the computable categoricity problem for projective planes
- Freely generated projective planes with finite computable dimension
- On functors enumerating structures
- Effective categoricity for distributive lattices and Heyting algebras
- Degrees of categoricity of computable structures
- Computable abelian groups
- Computable structures and operations on the space of continuous functions
- Limitwise monotonic sequences and degree spectra of structures
- A directed graph of finite \(\Delta^0_{\alpha}\)-dimension
- Strength and weakness in computable structure theory
- On Constructive Nilpotent Groups
- Some Questions in Computable Mathematics
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
- scientific article; zbMATH DE number 5836294 (Why is no real title available?)
- Computability of Fraïssé limits
- On the complexity of the successivity relation in computable linear orderings
- Isomorphisms, definable relations, and Scott families for integral domains and commutative semigroups
- Classes of Ulm type and coding rank-homogeneous trees in other structures
- Computable categoricity of trees of finite height
- The isomorphism problem for computable Abelian p-groups of bounded length
- Equivalence Relations on Classes of Computable Structures
- Prime models of finite computable dimension
- d-computable categoricity for algebraic fields
- Algebraic aspects of the computably enumerable degrees.
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- Degree Spectra of Relations on Computable Structures
- There is no classification of the decidably presentable structures
- Torsion-free abelian groups with optimal Scott families
- Uniform procedures in uncountable structures
- A Friedberg enumeration of equivalence structures
- Analytic computable structure theory and L^p spaces
- Some new computable structures of high rank
- Degrees of categoricity and spectral dimension
- A computable functor from graphs to fields
- BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Measuring complexities of classes of structures
- COPYING ONE OF A PAIR OF STRUCTURES
- INTERPRETING A FIELD IN ITS HEISENBERG GROUP
- A structure of punctual dimension two
- Lowness for isomorphism, countable ideals, and computable traceability
- Categoricity spectra for polymodal algebras
- Degrees of and lowness for isometric isomorphism
- CODING IN GRAPHS AND LINEAR ORDERINGS
- Categoricity properties for computable algebraic fields
- Theory spectra and classes of theories
- Turing degrees of nonabelian groups
- Π11 relations and paths through
- scientific article; zbMATH DE number 5066582 (Why is no real title available?)
- Spectra of theories and structures
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Computable functors and effective interpretability
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Point Degree Spectra of Represented Spaces
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Categoricity and complexity of relations over algebraic structures
- On the effective universality of mereological theories
- On two types of concept lattices in the theory of numberings
- Computable Heyting algebras with distinguished atoms and coatoms
- The complexity of central series in nilpotent computable groups
- Degrees of isomorphism types and countably categorical groups
- Failure modes for structural highness notions
- Computable isomorphisms of Boolean algebras with operators
- The computable embedding problem
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)
