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

MaRDI QIDQ351271zbMATH OpenFDO

Authors 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 codingMatiyasevich's theoremGödel-Bernays set theory

Mathematics Subject Classification ID

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

Recommendations

• On a Diophantine representation of the predicate of provability
• Diophantine equations and provability in mathematics
• On a theorem of Matiyasevich
• scientific article; zbMATH DE number 1261118
• A Note on Diophantine Representations

Cited in

(5)

• On a Diophantine representation of the predicate of provability
• On a theorem of Matiyasevich
• Polynomials over the reals in proofs of termination : from theory to practice
• Diophantine equations and provability in mathematics
• scientific article; zbMATH DE number 218550 (Why is no real title available?)

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

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