\textit{Theorema}: Towards computer-aided mathematical theory exploration

From MaRDI portal
Revision as of 15:27, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:865646

DOI10.1016/J.JAL.2005.10.006zbMath1107.68095OpenAlexW2133093325MaRDI QIDQ865646

Koji Nakagawa, Bruno Buchberger, Florina Piroi, Wolfgang Windsteiger, Tudor Jebelean, Adrian Crǎciun, Markus Rosenkranz, Judit Robu, Laura Kovács, Nikolaj Popov, Temur Kutsia

Publication date: 20 February 2007

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2005.10.006




Related Items (31)

A fully automatic theorem prover with human-style outputTheory exploration powered by deductive synthesisGeometry constructions languageAutomated theory exploration for interactive theorem proving: an introduction to the Hipster systemLearning to reason assisted by automated reasoningThe area method. A recapitulationConjecture synthesis for inductive theoriesQuick specifications for the busy programmerFormal analysis of optical systemsSynthesis of list algorithms by mechanical provingUser interaction with the Matita proof assistantIncorporating quotation and evaluation into Church's type theoryDynamic Rippling, Middle-Out Reasoning and Lemma DiscoveryVariadic equational matching in associative and commutative theoriesTranslating between Language and Logic: What Is Easy and What Is DifficultUsing Theorema in the Formalization of Theoretical EconomicsFlat matchingAutomatic Verification of Regular Constructions in Dynamic Geometry SystemsReasoning Algebraically About P-Solvable LoopsThe RISC ProofNavigator: a proving assistant for program verification in the classroomMathLang Translation to Isabelle SyntaxUsing computer algebra techniques for the specification, verification and synthesis of recursive programsA Symbolic Framework for Operations on Linear Boundary ProblemsThousands of Geometric Problems for Geometric Theorem Provers (TGTP)A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable ProofsOn the relation between context and sequence unificationA verified common lisp implementation of Buchberger's algorithm in ACL2Hipster: Integrating Theory Exploration in a Proof AssistantHigh-Level TheoriesOn Correctness of Mathematical Texts from a Logical and Practical Point of ViewGeoThms — a Web System for Euclidean Constructive Geometry


Uses Software



Cites Work




This page was built for publication: \textit{Theorema}: Towards computer-aided mathematical theory exploration