Classifications of definable subsets
From MaRDI portal
Publication:2300934
Recommendations
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)