Classification of Quantifier Prefixes Over Diophantine Equations

DOI10.1002/MALQ.19810272504MaRDI QIDQ3926566zbMATH OpenOpenAlexFDO

Authors James P. Jones

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

zbMATH Keywords

arithmetical sentences

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05)

Cited in

(10)

• Some undecidable determined games
• Computational complexity of winning strategies in two-person polynomial games
• Sentences over integral domains and their computational complexities
• Expository notes on computability and complexity in (arithmetical) games
• Uncomputably large integral points on algebraic plane curves?
• The many aspects of counting lattice points in polytopes
• Extensions of Hilbert's tenth problem
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Mixed quantifier prefixes over Diophantine equations with integer variables
• Further results on Hilbert's tenth problem

This page was built for publication: Classification of Quantifier Prefixes Over Diophantine Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3926566)