Generic undecidability of existential theory of integer numbers ring

DOI10.17377/SEMI.2016.13.070MaRDI QIDQ2402142zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 6 September 2017

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

generic complexityexistential theory of ring of integer numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Undecidability and degrees of sets of sentences (03D35) Decidability (number-theoretic aspects) (11U05)

Recommendations

• Undecidability in number theory
• Questions of decidability and undecidability in Number Theory
• An Undecidability Result for Power Series Rings of Positive Characteristic. II
• Undecidability in number theory
• Diophantine undecidability for addition and divisibility in polynomial rings

Cited in

(2)

• Generic amplification of recursively enumerable sets
• Undecidability in number theory

This page was built for publication: Generic undecidability of existential theory of integer numbers ring

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