Classification of Quantifier Prefixes Over Diophantine Equations
From MaRDI portal
Publication:3926566
DOI10.1002/malq.19810272504zbMath0472.03034OpenAlexW2040107157MaRDI QIDQ3926566
Publication date: 1981
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19810272504
Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05) Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Diophantine equations (11D99)
Related Items
Further results on Hilbert's tenth problem ⋮ Extensions of Hilbert's tenth problem ⋮ Expository notes on computability and complexity in (arithmetical) games ⋮ Some undecidable determined games ⋮ Uncomputably large integral points on algebraic plane curves? ⋮ Computational complexity of winning strategies in two-person polynomial games ⋮ The many aspects of counting lattice points in polytopes ⋮ Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy ⋮ Sentences over integral domains and their computational complexities