Independence in computable algebra

DOI10.1016/J.JALGEBRA.2015.06.004MaRDI QIDQ497725zbMATH OpenOpenAlexFDO

Authors Matthew Harrison-Trainor, Antonio Montalbán, Alexander Melnikov

Publication date 25 September 2015

Published in Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

pregeometrycomputable structurecomputable algebra

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Abstract: We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and difference closed fields with the relevant notions of independence. To cover these classes of structures we introduce a new technique of safe extensions that was not necessary for the previously known results of this kind. We will then apply our techniques to derive new corollaries on the number of computable presentations of these structures. The condition also implies classical and new results on vector spaces, algebraically closed fields, torsion-free abelian groups and Archimedean ordered abelian groups.

Recommendations

• \(\Pi^0_1\)-presentations of algebras
• On computable aspects of algebraic and definable closure
• Categoricity properties for computable algebraic fields
• \(d\)-computable categoricity for algebraic fields
• Computable dimension for ordered fields

Cites work

• scientific article; zbMATH DE number 1002918 (Why is no real title available?)
• scientific article; zbMATH DE number 3863176 (Why is no real title available?)
• scientific article; zbMATH DE number 5014851 (Why is no real title available?)
• scientific article; zbMATH DE number 3573995 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1303202 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (Why is no real title available?)
• scientific article; zbMATH DE number 1318491 (Why is no real title available?)
• scientific article; zbMATH DE number 1160037 (Why is no real title available?)
• scientific article; zbMATH DE number 1169378 (Why is no real title available?)
• scientific article; zbMATH DE number 1936723 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3207354 (Why is no real title available?)
• scientific article; zbMATH DE number 3222127 (Why is no real title available?)
• scientific article; zbMATH DE number 3250559 (Why is no real title available?)
• scientific article; zbMATH DE number 3308418 (Why is no real title available?)
• scientific article; zbMATH DE number 3332554 (Why is no real title available?)
• scientific article; zbMATH DE number 3349995 (Why is no real title available?)
• scientific article; zbMATH DE number 3406215 (Why is no real title available?)
• scientific article; zbMATH DE number 3053259 (Why is no real title available?)
• scientific article; zbMATH DE number 3056446 (Why is no real title available?)
• Autostability of models and Abelian groups
• Bases of supermaximal subspaces and Steinitz systems. I
• CONSTRUCTIVE ALGEBRAS I
• Complexity of structures associated with real closed fields
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable abelian groups
• Computable completely decomposable groups
• Computable structures and the hyperarithmetical hierarchy
• Controlling the dependence degree of a recursively enumerable vector space
• Countable vector spaces with recursive operations Part I¹
• Countable vector spaces with recursive operations Part II
• Definable Sets in Ordered Structures. I
• Definable Sets in Ordered Structures. II
• Effective content of field theory
• Effective model theory vs. recursive model theory
• Effective procedures in field theory
• Generic copies of countable structures
• Model Theory
• Model theory of difference fields
• On the Abstract Properties of Linear Dependence
• On the decidability of the real field with a generic power function
• Recursively enumerable vector spaces
• Recursively presentable prime models
• Rice sequences of relations
• Some constructivizations of Abelian groups
• Stable domination and independence in algebraically closed valued fields
• Subgroups of finitely presented groups
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
• The axioms of quantity and the theory of measurement. (Translated from part I of Otto Hölder's German text Die Axiome der Quantität und die Lehre vom Mass)
• The complexity of ascendant sequences in locally nilpotent groups
• The computable dimension of ordered abelian groups
• The rational points of a definable set
• Two notes on vector spaces with recursive operations

Cited in

(16)

• Punctually presented structures I: Closure theorems
• Computable valued fields
• New degree spectra of Polish spaces
• Torsion-free abelian groups with optimal Scott families
• Whitehead's problem and reverse mathematics
• Computable topological abelian groups
• On computable aspects of algebraic and definable closure
• \(\Pi^0_1\)-presentations of algebras
• Graphs are not universal for online computability
• Computable topological groups and Pontryagin duality
• Reverse mathematics of matroids
• Categorical linearly ordered structures
• Algebraic structures computable without delay
• Relativizing computable categoricity
• Decompositions of decidable abelian groups
• A criterion for P-computability of structures

This page was built for publication: Independence in computable algebra

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