Finding bases of uncountable free abelian groups is usually difficult

DOI10.1090/TRAN/7232MaRDI QIDQ4608785zbMATH OpenOpenAlexFDO

Authors Noam Greenberg, Dan Turetsky, Linda Brown Westrick

Publication date 28 March 2018

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.02326

zbMATH Keywords

admissible computabilitycomputable algebradefinabilityfree abelian group

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abelian groups (20K99)

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 the cardinality. For example, we show, under the assumption $V=L$, that there is a first-order definable free abelian group with no first-order definable basis.

Recommendations

• Describing free groups
• Describing free groups. II: \(\Pi ^{0}_{4}\) hardness and no \(\Sigma _{2}^{0}\) basis
• Freely indecomposable almost free groups with free abelianization
• scientific article; zbMATH DE number 4038090
• Decidability and computability of certain torsion-free abelian groups

Cites work

• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• Adding a closed unbounded set
• Classes of structures with universe a subset of \(\omega _{1}\)
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
• Computability and uncountable linear orders. I: Computable categoricity.
• Computable Algebra, General Theory and Theory of Computable Fields
• CONSTRUCTIVE ALGEBRAS I
• Effective Mathematics of the Uncountable
• Effective procedures in field theory
• Effectively categorical abelian groups
• scientific article; zbMATH DE number 6536307 (Why is no real title available?)
• scientific article; zbMATH DE number 3591987 (Why is no real title available?)
• scientific article; zbMATH DE number 1762597 (Why is no real title available?)
• scientific article; zbMATH DE number 3332554 (Why is no real title available?)
• Infinite Abelian groups, Whitehead problem and some constructions
• Negative solutions to Post's problem. II
• New Criteria for Freeness in Abelian Groups
• On the Existence of κ-Free Abelian Groups
• Ordinal computability
• Recursion theory week. Proceedings of a conference held in Oberwolfach, Germany, March 19-25, 1989
• Recursively enumerable vector spaces
• Shelah's singular compactness theorem.
• Subgroups of finitely presented groups
• The arithmetical hierarchy in the setting of _1
• The fine structure of the constructible hierarchy
• The role of true finiteness in the admissible recursively enumerable degrees
• The theory of topological commutative groups
• The unsolvability of the problem of the equivalence of words in a group and several other problems in algebra
• THE WORD PROBLEM
• Uniform procedures in uncountable structures

Cited in

(5)

• Describing free groups
• Uniform procedures in uncountable structures
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• Discrete subgroups of normed spaces are free
• The geometry of computable Banach spaces

This page was built for publication: Finding bases of uncountable free abelian groups is usually difficult

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608785)