Pages that link to "Item:Q1381432"
From MaRDI portal
The following pages link to Computable models of theories with few models (Q1381432):
Displayed 18 items.
- New spectra of strongly minimal theories in finite languages (Q638500) (← links)
- A new spectrum of recursive models (Q701304) (← links)
- Computable shuffle sums of ordinals (Q938232) (← links)
- On two problems of Turing complexity for strongly minimal theories (Q954212) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees (Q1612486) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- An uncountably categorical theory whose only computably presentable model is saturated (Q2505131) (← links)
- Prime models of theories of computable linear orderings (Q2723507) (← links)
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 (Q3011106) (← links)
- A new spectrum of recursive models using an amalgamation construction (Q3173531) (← links)
- A computable ℵ<sub>0</sub>-categorical structure whose theory computes true arithmetic (Q3570169) (← links)
- Classifying model-theoretic properties (Q3617367) (← links)
- Limitwise monotonic functions, sets, and degrees on computable domains (Q5190192) (← links)
- On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141) (← links)
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 (Q5421032) (← links)
- Applications of Kolmogorov complexity to computable model theory (Q5422317) (← links)
- <i>η</i>-representation of sets and degrees (Q5502806) (← links)