Bulletin of the Belgian Mathematical Society - Simon Stevin

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

M. Carl and B.Z. Moroz

Full-text: Open access

Article information

Source
Bull. Belg. Math. Soc. Simon Stevin, Volume 20, Number 1 (2013), 181-187.

Dates
First available in Project Euclid: 18 April 2013

Permanent link to this document
https://projecteuclid.org/euclid.bbms/1366306724

Mathematical Reviews number (MathSciNet)
MR3082753

Zentralblatt MATH identifier
1288.11113

Subjects
Primary: 11D72: Equations in many variables [See also 11P55] 11G35: Varieties over global fields [See also 14G25] 11U05: Decidability [See also 03B25] 03E55: Large cardinals

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

Citation

Carl, M.; Moroz, B.Z. A polynomial encoding provability in pure mathematics (outline of an explicit construction). Bull. Belg. Math. Soc. Simon Stevin 20 (2013), no. 1, 181--187. https://projecteuclid.org/euclid.bbms/1366306724


Export citation