Recursion theory on fields and abstract dependence

DOI10.1016/0021-8693(80)90237-9MaRDI QIDQ1156793zbMATH OpenOpenAlexFDO

Authors G. Metakides, Anil Nerode

Publication date 1980

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

Full work available at URL https://doi.org/10.1016/0021-8693(80)90237-9

zbMATH Keywords

lattice of r.e. algebraically closed subfields of an effective algebraically closed field of countably infinite transcendence degreerecursively presented Steinitz closure systems

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Connections between field theory and logic (12L99)

Cites work

• A r-maximal vector space not contained in any maximal vector space
• Controlling the dependence degree of a recursively enumerable vector space
• Effective content of field theory
• Effective dimension
• Effective procedures in field theory
• scientific article; zbMATH DE number 600607 (Why is no real title available?)
• scientific article; zbMATH DE number 3443640 (Why is no real title available?)
• scientific article; zbMATH DE number 3227055 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3058859 (Why is no real title available?)
• Major subspaces of recursively enumerable vector spaces
• Maximal and Cohesive vector spaces
• Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
• On the factorization of polynomials in a finite number of steps
• Recursively enumerable vector spaces
• Simple and hyperhypersimple vector spaces

Cited in

(21)

• First-order theories of abstract dependence relations
• Intersections of algebraically closed fields
• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• Recursion theory and ordered groups
• An infinite version of Arrow's theorem in the effective setting
• Nonpresentability of some structures of analysis in hereditarily finite superstructures
• Dependency relations
• A sufficient condition for nonpresentability of structures in hereditarily finite superstructures
• Ideals in computable rings
• Learning families of closed sets in matroids
• Reverse mathematics of matroids
• Orbits of Creative Subspaces
• More undecidable lattices of Steinitz exchange systems
• Automorphisms of supermaximal subspaces
• Co-immune subspaces and complementation inV_∞
• Decidable subspaces and recursively enumerable subspaces
• Bases of supermaximal subspaces and Steinitz systems. I
• The universal complementation property
• Recursive properties of relations on models
• Dependence relations in computably rigid computable vector spaces
• On the learnability of vector spaces

This page was built for publication: Recursion theory on fields and abstract dependence

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