Decidable fragments of field theories

DOI10.2307/2274469zbMath0724.03010OpenAlexW2132325084MaRDI 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

zbMATH Keywords

algebraic number fieldpurely transcendental extensionaxiomatizablefield of characteristic zero\(\forall \exists \) sentences in the language of ringsextension of the rationals

Mathematics Subject Classification ID

Decidability and field theory (12L05) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Algorithms for sentences over integral domains ⋮ Computational complexity of sentences over fields ⋮ Polynomial time algorithms for sentences over number fields

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidable fragments of field theories