Decidable fragments of field theories
From MaRDI portal
Publication:5202171
DOI10.2307/2274469zbMath0724.03010MaRDI QIDQ5202171
No author found.
Publication date: 1990
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274469
algebraic number field; purely transcendental extension; axiomatizable; field of characteristic zero; \(\forall \exists \) sentences in the language of rings; extension of the rationals
Related Items
Algorithms for sentences over integral domains, Computational complexity of sentences over fields, Polynomial time algorithms for sentences over number fields
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- The elementary theory of finite fields
- Factoring Polynomials over Algebraic Number Fields
- Provability and Decidability of Arithmetical Universal-Existential Sentences
- THE UNDECIDABILITY OF PURE TRANSCENDENTAL EXTENSIONS OF REAL FIELDS
- Definability and decision problems in arithmetic