Definability via enumerations (Q3483272)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4154428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Definability via enumerations |
scientific article; zbMATH DE number 4154428 |
Statements
Definability via enumerations (English)
0 references
1989
0 references
relative computability in abstract structures
0 references
partial structure with denumerable domain
0 references
\(\forall \)-admissibility
0 references
search computability
0 references
Skordev's conjecture
0 references
search-computable functions
0 references
0.7722874283790588
0 references
