Mathematical Theory Exploration in Theorema: Reduction Rings

DOI10.1007/978-3-319-42547-4_1zbMath1344.68210arXiv1602.04339OpenAlexW3099560056MaRDI QIDQ2817288

Alexander Maletzky

Publication date: 30 August 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04339

zbMATH Keywords

Gröbner basesautomated reasoningTheoremacomputer-supported theory explorationreduction rings

Mathematics Subject Classification ID

Related Items (1)

Interactive Proving, Higher-Order Rewriting, and Theory Analysis in Theorema 2.0

Uses Software

• ACL2
• Theorema

Cites Work

• The reduction ring property is hereditary
• Certifying properties of an efficient functional program for computing Gröbner bases
• A verified common lisp implementation of Buchberger's algorithm in ACL2
• A generalization of reduction rings
• A machine-checked implementation of Buchberger's algorithm
• Theorema 2.0: A System for Mathematical Theory Exploration
• Gröbner bases and generalized sylvester matrices
• The Theorema Environment for Interactive Proof Development
• Mathematical Knowledge Management
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical Theory Exploration in Theorema: Reduction Rings