Pages that link to "Item:Q2501165"
From MaRDI portal
The following pages link to A computably stable structure with no Scott family of finitary formulas (Q2501165):
Displaying 4 items.
- Complexity and categoricity (Q1383162) (← links)
- Computable Scott sentences for quasi-Hopfian finitely presented structures (Q2700812) (← links)
- An autostable 1-decidable model without a computable Scott family of \(\exists\)-formulas (Q2709313) (← links)
- Applications of Kolmogorov complexity to computable model theory (Q5422317) (← links)