OpenAlex
Finding bases of uncountable free abelian groups is usually difficult
Work
Year: 2017
Type: article
Abstract: We investigate effective properties of uncountable free abelian groups. We show that identifying free abelian groups and constructing bases for such groups is often computationally hard, depending on ... more
Source: Transactions of the American Mathematical Society
Authors Noam Greenberg, Dan Turetsky, Linda Brown Westrick
Institutions Victoria University of Wellington, University of Connecticut
Cites: 33
Cited by: 6
Related to: 10
FWCI: 1.11
Citation percentile (by year/subfield): 54.18
Topic: Advanced Topology and Set Theory
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze