Classifications of definable subsets
DOI10.1007/S10469-019-09559-7zbMATH Open1480.03023OpenAlexW2991947668MaRDI QIDQ2300934FDOQ2300934
Authors: Yanyan Li 
Publication date: 28 February 2020
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-019-09559-7
Recommendations
\(\Sigma_1^0\)-classification\(\Sigma_2^0 \)-classification\(d\)-\(\Sigma_1^0 \)-classificationunbounded computable equivalence structureunbounded computable injection structure
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Interpolation, preservation, definability (03C40)
Cites Work
- The isomorphism problem on classes of automatic structures with transitive relations
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Title not available (Why is that?)
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Effective categoricity of equivalence structures
- \(\Delta^0_2\)-categoricity of equivalence structures
- Title not available (Why is that?)
- \({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
- A Friedberg enumeration of equivalence structures
- Computability theoretic classifications for classes of structures
- Classifications of computable structures
- Computability-theoretic properties of injection structures
- On \(\Sigma^0_1\)-classification of relations on computable structures
Cited In (6)
- Title not available (Why is that?)
- Definable elements of definable Borel sets
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- Logically defined subsets of \(\mathbb{N}{}^ k\)
- The subset relation and 2‐stratified sentences in set theory and class theory
- On \(\Sigma^0_1\)-classification of relations on computable structures
This page was built for publication: Classifications of definable subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300934)
