Pages that link to "Item:Q4452455"
From MaRDI portal
The following pages link to On the complexity of categoricity in computable structures (Q4452455):
Displayed 10 items.
- The complexity of computable categoricity (Q471691) (← links)
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms (Q893075) (← links)
- Index sets for some classes of structures (Q1006610) (← links)
- Scott sentences for certain groups (Q1745362) (← links)
- Degrees of autostability relative to strong constructivizations for Boolean algebras (Q2364293) (← links)
- Degrees of autostability for linear orders and linearly ordered abelian groups (Q2364330) (← links)
- 2010 North American Annual Meeting of the Association for Symbolic Logic (Q3083467) (← links)
- Computable categoricity of trees of finite height (Q3370760) (← links)
- Categoricity properties for computable algebraic fields (Q5246988) (← links)
- Index sets for classes of high rank structures (Q5444710) (← links)