On the complexity of the theory of a computably presented metric structure (Q6077947)
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 7742505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the theory of a computably presented metric structure |
scientific article; zbMATH DE number 7742505 |
Statements
On the complexity of the theory of a computably presented metric structure (English)
0 references
27 September 2023
0 references
computable structure theory
0 references
continuous logic
0 references
computable analysis
0 references
metric structures
0 references
hyperarithmetical hierarchy
0 references
0 references
0 references
0 references
0.91054213
0 references
0 references
0.8980377
0 references
0.89216477
0 references
0.89025027
0 references
0.8895066
0 references
