A polynomial encoding provability in pure mathematics (outline of an explicit construction)

zbMath1288.11113MaRDI QIDQ351271

Merlin Carl, B. Z. Moroz

Publication date: 11 July 2013

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bbms/1366306724

zbMATH Keywords

Diophantine coding; Gödel-Bernays set theory; Matiyasevich's theorem

Mathematics Subject Classification ID

11U05: Decidability (number-theoretic aspects)

11G35: Varieties over global fields

03E55: Large cardinals

11D72: Diophantine equations in many variables