Groebner bases in Theorema
DOI10.1007/978-3-662-44199-2_58zbMATH Open1437.13009OpenAlexW583699068MaRDI QIDQ2879150FDOQ2879150
Authors: Bruno Buchberger, Alexander Maletzky 
Publication date: 8 September 2014
Published in: Mathematical Software – ICMS 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44199-2_58
Recommendations
- Theorem proving for and with Gröbner bases theory
- Mathematical theory exploration in Theorema: reduction rings
- \textit{Theorema}: Towards computer-aided mathematical theory exploration
- scientific article; zbMATH DE number 1070620
- Interactive Proving, Higher-Order Rewriting, and Theory Analysis in Theorema 2.0
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Research data for problems pertaining to commutative algebra (13-11)
Cited In (11)
- Automated reasoning in reduction rings using the Theorema system
- Title not available (Why is that?)
- Computer Algebra in Scientific Computing
- Mathematical theory exploration in Theorema: reduction rings
- \textit{Theorema}: Towards computer-aided mathematical theory exploration
- Mathematical Knowledge Management
- Theorem proving for and with Gröbner bases theory
- Theorema
- Title not available (Why is that?)
- Interfacing external CA systems for Gröbner bases computation in Mizar proof checking
- Complexity analysis of the bivariate Buchberger algorithm in Theorema
Uses Software
This page was built for publication: Groebner bases in Theorema
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879150)
