Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
From MaRDI portal
Publication:904324
DOI10.1007/s10469-015-9353-6zbMath1375.03036MaRDI QIDQ904324
Valentina S. Harizanov, Ekaterina B. Fokina, Sergei S. Goncharov, Oleg V. Kudinov, Daniel D. Turetsky
Publication date: 13 January 2016
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-015-9353-6
index set; \(n\)-decidable structure categorical relative to \(m\)-decidable presentations; structure categorical relative to \(n\)-decidable presentations
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
03C35: Categoricity and completeness of theories
Related Items
On the complexity of the theory of a computably presented metric structure, Boolean algebras autostable relative to \(n\)-decidable presentations, On decidable categoricity and almost prime models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Autostability of prime models under strong constructivizations
- The complexity of computable categoricity
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
- The index set of Boolean algebras autostable relative to strong constructivizations
- Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
- Problem of the number of non-self-equivalent constructivizations
- Autostability and computable families of constructivizations
- Discrete families of recursive functions and index sets
- Degrees of autostability relative to strong constructivizations
- Degrees of categoricity of computable structures
- Turing's Legacy
- On autostability of almost prime models relative to strong constructivizations
- Effective procedures in field theory
- Non Σn axiomatizable almost strongly minimal theories
- Computable categoricity versus relative computable categoricity
- Complexity of Categorical Theories with Computable Models
- Spectra of theories and structures
- Index Sets of Constructive Models that are Autostable Under Strong Constructivizations