Automating Elementary Number-Theoretic Proofs Using Gröbner Bases

Authors:
John Harrison
Affiliations:
Intel Corporation, JF1-13, 2111 NE 25th Avenue, Hillsboro OR 97124, USA
Venue:
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Year:
2007

Citing 6
Cited 5

An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras

Proc. of the first international conference on Rewriting techniques and applications
Gro¨bner bases: a computational approach to commutative algebra

Gro¨bner bases: a computational approach to commutative algebra
Logical features of Horn Clauses

Handbook of logic in artificial intelligence and logic programming (vol. 1)
HOL Light: A Tutorial Introduction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings

EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Presburger''s Article on Integer Arithmetic: Remarks and Translation

Presburger''s Article on Integer Arithmetic: Remarks and Translation

Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Proof certificates for algebra and their application to automatic geometry theorem proving

ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
Formal Power Series

Journal of Automated Reasoning
Formalization of wu's simple method in coq

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Scalable LCF-Style proof translation

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a uniform algorithm for proving automatically a fairly wide class of elementary facts connected with integer divisibility. The assertions that can be handled are those with a limited quantifier structure involving addition, multiplication and certain number-theoretic predicates such as `divisible by', `congruent' and `coprime'; one notable example in this class is the Chinese Remainder Theorem (for a specific number of moduli). The method is based on a reduction to ideal membership assertions that are then solved using Gröbner bases. As well as illustrating the usefulness of the procedure on examples, and considering some extensions, we prove a limited form of completeness for properties that hold in all rings.