Prime representing polynomial with 10 unknowns -- introduction

DOI10.2478/FORMA-2022-0013MaRDI QIDQ6489409zbMATH OpenFDO

Authors Karol Pąk

Publication date 22 April 2024

Published in Formalized Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

zbMATH Keywords

Diophantine equationpolynomial reduction

Mathematics Subject Classification ID

Formalization of mathematics in connection with theorem provers (68V20) Counting solutions of Diophantine equations (11D45)

Recommendations

• Prime representing polynomial with 10 unknowns
• Prime representing polynomial with 10 unknowns -- introduction. II
• Prime representing polynomial
• Reduction of unknowns in diophantine representations
• Formalizing a Diophantine representation of the set of prime numbers

Cites work

• Isabelle formalization of set theoretic structures and set comprehensions
• Mizar: state-of-the-art and beyond
• Polish notation
• Preliminaries to classical first-order model theory
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• The role of the Mizar mathematical library for interactive proof development in Mizar

Cited in

(2)

• Prime representing polynomial with 10 unknowns -- introduction. II
• Prime representing polynomial with 10 unknowns

This page was built for publication: Prime representing polynomial with 10 unknowns -- introduction

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