Classifications of definable subsets

DOI10.1007/S10469-019-09559-7MaRDI QIDQ2300934zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(\Sigma_1^0\)-classification\(\Sigma_2^0 \)-classification\(d\)-\(\Sigma_1^0 \)-classificationunbounded computable equivalence structureunbounded computable injection structure

Mathematics Subject Classification ID

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

Recommendations

• On \(\Sigma^0_1\)-classification of relations on computable structures
• Classifications of computable structures
• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
• Computability-theoretic properties of injection structures
• Equivalence Relations on Classes of Computable Structures

Cites work

• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 2167508 (Why is no real title available?)
• A Friedberg enumeration of equivalence structures
• Classifications of computable structures
• Computability theoretic classifications for classes of structures
• Computability-theoretic properties of injection structures
• Effective categoricity of equivalence structures
• On \(\Delta_2^0\)-categoricity of equivalence relations
• On \(\Sigma^0_1\)-classification of relations on computable structures
• 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
• \(\Delta^0_2\)-categoricity of equivalence structures
• \({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures

Cited in

(6)

• scientific article; zbMATH DE number 4195916 (Why is no real title available?)
• 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)