Index sets for classes of high rank structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- Computable structures and the hyperarithmetical hierarchy
- Index sets of computable structures
- On the complexity of categoricity in computable structures
- Pairs of recursive structures
- Scott sentences and admissible sets
Cited in
(12)- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Computable elements and functions in effectively enumerable topological spaces
- Some new computable structures of high rank
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms
- Rice's theorem in effectively enumerable topological spaces
- Index sets for some classes of structures
- Computability in infinite Galois theory and algorithmically random algebraic fields
- There is no classification of the decidably presentable structures
- On Σ1 1 equivalence relations over the natural numbers
- Index sets of computable structures
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
This page was built for publication: Index sets for classes of high rank structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444710)