Theorema 2.0: Computer-Assisted Natural-Style Mathematics
From MaRDI portal
Publication:5195272
DOI10.6092/issn.1972-5787/4568zbMath1451.68319OpenAlexW2254208305MaRDI QIDQ5195272
Wolfgang Windsteiger, Bruno Buchberger, Temur Kutsia, Alexander Maletzky, Tudor Jebelean
Publication date: 18 September 2019
Full work available at URL: https://doaj.org/article/0e8a05e1a76e4add901829ccc6492c8c
Related Items (13)
\textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} ⋮ A heuristic prover for elementary analysis in \textit{Theorema} ⋮ Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques ⋮ A bi-directional extensible interface between Lean and Mathematica ⋮ Automated programming, symbolic computation, machine learning: my personal view ⋮ Experiments with automated reasoning in the class ⋮ Learning to reason assisted by automated reasoning ⋮ Synthesis of sorting algorithms using multisets in \textit{Theorema} ⋮ Calculational relation-algebraic proofs in the teaching tool \textsc{CalcCheck} ⋮ A generic and executable formalization of signature-based Gröbner basis algorithms ⋮ Verified interactive computation of definite integrals ⋮ Theorema ⋮ Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema
Uses Software
This page was built for publication: Theorema 2.0: Computer-Assisted Natural-Style Mathematics
