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

zbMath1288.11113MaRDI QIDQ351271

B. Z. Moroz, Merlin Carl

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 codingGödel-Bernays set theoryMatiyasevich's theorem

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Varieties over global fields (11G35) Large cardinals (03E55) Diophantine equations in many variables (11D72)

Related Items (1)

On a theorem of Matiyasevich

This page was built for publication: A polynomial encoding provability in pure mathematics (outline of an explicit construction)