Some highly undecidable lattices
From MaRDI portal
The main result of this paper is: If an algebraically closed field K has infinite transcendence degree over its prime field, then the first-order theory of the lattice of K's algebraically closed subfields has the logical complexity of full second-order logic on the set K. A similar, although not as strong, result is also proved for the more general setting in which the role of K is filled by a Steinitz exchange system.
Recommendations
- More undecidable lattices of Steinitz exchange systems
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- Publication:4726298
- Some undecidability results for lattices in recursion theory
- The undecidability of the elementary theory of lattices of all equational theories of large signature
Cites work
- scientific article; zbMATH DE number 3578867 (Why is no real title available?)
- scientific article; zbMATH DE number 600607 (Why is no real title available?)
- scientific article; zbMATH DE number 3050844 (Why is no real title available?)
- Intersections of algebraically closed fields
- Some theories associated with algebraically closed fields
Cited in
(7)- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- Elementary equivalence of infinite-dimensional classical groups
- The undecidability of the elementary theory of lattices of all equational theories of large signature
- More undecidable lattices of Steinitz exchange systems
- On ruled fields
- Winter meeting of the Association for Symbolic Logic, San Antonio, 1993
- scientific article; zbMATH DE number 3999991 (Why is no real title available?)
This page was built for publication: Some highly undecidable lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584255)
