Algorithmic complexity of countable models of strongly minimal theories (Q2885255)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic complexity of countable models of strongly minimal theories |
scientific article; zbMATH DE number 6037313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity of countable models of strongly minimal theories |
scientific article; zbMATH DE number 6037313 |
Statements
21 May 2012
0 references
computable structure
0 references
hyperarithmetical hierarchy
0 references
strongly minimal set
0 references
Algorithmic complexity of countable models of strongly minimal theories (English)
0 references
0.8401759266853333
0 references
0.835196852684021
0 references
0.8263279795646667
0 references
0.8089206218719482
0 references
