Online presentations of finitely generated structures
| Autor: | Keng Meng Ng, Alexander G. Melnikov, Nikolay Bazhenov, Iskander Sh. Kalimullin |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Pure mathematics
Conjecture General Computer Science Structure (category theory) 0102 computer and information sciences 02 engineering and technology 01 natural sciences Theoretical Computer Science 010201 computation theory & mathematics Content (measure theory) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Finitely-generated abelian group Algebraic number Mathematics |
| Zdroj: | Theoretical Computer Science. 844:195-216 |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2020.08.021 |
| Popis: | We systematically investigate into the online content of finitely generated structures. The online content of a potentially infinite algebraic or combinatorial structure is perhaps best reflected by its PR-degrees (to be defined). We confirm a natural conjecture by showing that the PR-degrees of a finitely generated structure must be dense. Remarkably, we show that PR-degrees of an f.g. structure do not have to be upwards dense. As an application of our techniques, we refute a natural conjecture about honestly generated structures (to be stated). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect