Recursion theory on fields and abstract dependence
DOI10.1016/0021-8693(80)90237-9zbMATH Open0469.03029OpenAlexW2000803808MaRDI QIDQ1156793FDOQ1156793
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
lattice of r.e. algebraically closed subfields of an effective algebraically closed field of countably infinite transcendence degreerecursively presented Steinitz closure systems
Theory of numerations, effectively presented structures (03D45) Connections between field theory and logic (12L99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective content of field theory
- Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
- Recursively enumerable vector spaces
- Title not available (Why is that?)
- Effective procedures in field theory
- Controlling the dependence degree of a recursively enumerable vector space
- A r-maximal vector space not contained in any maximal vector space
- On the factorization of polynomials in a finite number of steps
- Title not available (Why is that?)
- Effective dimension
- Simple and hyperhypersimple vector spaces
- Major subspaces of recursively enumerable vector spaces
- Maximal and Cohesive vector spaces
Cited In (21)
- First-order theories of abstract dependence relations
- Recursion theory and ordered groups
- Dependence relations in computably rigid computable vector spaces
- Recursive properties of relations on models
- On the learnability of vector spaces
- An infinite version of Arrow's theorem in the effective setting
- Orbits of Creative Subspaces
- Reverse mathematics of matroids
- Nonpresentability of some structures of analysis in hereditarily finite superstructures
- Dependency relations
- Intersections of algebraically closed fields
- Bases of supermaximal subspaces and Steinitz systems. I
- Ideals in computable rings
- A sufficient condition for nonpresentability of structures in hereditarily finite superstructures
- More undecidable lattices of Steinitz exchange systems
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- Learning families of closed sets in matroids
- Automorphisms of supermaximal subspaces
- Co-immune subspaces and complementation inV∞
- Decidable subspaces and recursively enumerable subspaces
- The universal complementation property
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)
