On a theorem of Matiyasevich

DOI10.1134/S0001434620090047zbMath1482.11163OpenAlexW3096250744MaRDI QIDQ2210378

A. A. Norkin, B. Z. Moroz

Publication date: 6 November 2020

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434620090047

zbMATH Keywords

Riemann hypothesisbinomial coefficientsDiophantine equations

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial encoding provability in pure mathematics (outline of an explicit construction)
• On a Diophantine representation of the predicate of provability
• Some diophantine forms of gödel's theorem
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Hilbert's Tenth Problem is Unsolvable
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• Гипотеза Римана как чётность биномиальных коэффициентов
• DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
• Binomial Coefficients Modulo a Prime

This page was built for publication: On a theorem of Matiyasevich