Automated reasoning in reduction rings using the Theorema system

DOI10.1007/978-3-319-24021-3_23MaRDI QIDQ3454553zbMATH OpenOpenAlexFDO

Authors Alexander Maletzky

Publication date 25 November 2015

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24021-3_23

zbMATH Keywords

automated reasoningformalized mathematicsGröbner basesmathematical theory explorationreduction rings

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Formalization of mathematics in connection with theorem provers (68V20)

Recommendations

• Mathematical theory exploration in Theorema: reduction rings
• \textit{Theorema}: Towards computer-aided mathematical theory exploration
• Groebner bases in Theorema
• Automated deduction in ring theory
• scientific article; zbMATH DE number 1563438

Cited in

(5)

• A general framework for Noetherian well ordered polynomial reductions
• Superposition theorem proving for commutative rings
• Mathematical theory exploration in Theorema: reduction rings
• Automated deduction in ring theory
• Z-module reasoning

Describes a project that uses

Uses Software

• Theorema
• Mathematica

This page was built for publication: Automated reasoning in reduction rings using the Theorema system

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