Classifications of computable structures
From MaRDI portal
Publication:1704081
Recommendations
Cites work
- d-computable categoricity for algebraic fields
- Classification from a Computable Viewpoint
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable categoricity for algebraic fields with splitting algorithms
- 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
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 2047478 (Why is no real title available?)
- scientific article; zbMATH DE number 2167508 (Why is no real title available?)
- Index sets of computable structures
- Spectra of Algebraic Fields and Subfields
- Theorie Der Numerierungen III
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
Cited in
(10)- Enumerating abelian \(p\)-groups
- Learning families of algebraic structures from informant
- Classifications of definable subsets
- On ^0_1-classification of relations on computable structures
- Structural properties for feasibly computable classes of type two
- scientific article; zbMATH DE number 1984268 (Why is no real title available?)
- A Friedberg enumeration of equivalence structures
- The tree of tuples of a structure
- Isomorphism and classification for countable structures
- Computability theoretic classifications for classes of structures
This page was built for publication: Classifications of computable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704081)