scientific article; zbMATH DE number 5379427
From MaRDI portal
Publication:3544794
Recommendations
- Index Sets of Computable Structures with Decidable Theories
- scientific article; zbMATH DE number 3853049
- Complexity of the index set of a constructive model
- Computability of the set of computable indexing schemes of the class of constructible models
- Index sets of computable structures
- A note on decidable categoricity and index sets
- The complexity of index sets for several classes of models
- Decidability and the number of countable models
- Degrees of Indiscernibles in Decidable Models
- The number of computable indexations of finite classes of constructive models
Cited in
(15)- Index sets for some classes of structures
- A note on decidable categoricity and index sets
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
- Index sets of prime models
- Decidable models of -stable theories
- The complexity of countable categoricity in finite languages
- scientific article; zbMATH DE number 177484 (Why is no real title available?)
- There is no classification of the decidably presentable structures
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Index sets of constructive models that are autostable under strong constructivizations
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544794)