Finding bases of uncountable free abelian groups is usually difficult (Q4608785)
From MaRDI portal
scientific article; zbMATH DE number 6853984
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding bases of uncountable free abelian groups is usually difficult |
scientific article; zbMATH DE number 6853984 |
Statements
Finding bases of uncountable free abelian groups is usually difficult (English)
0 references
28 March 2018
0 references
free abelian group
0 references
computable algebra
0 references
admissible computability
0 references
definability
0 references
0 references
0 references
