Theorema

From MaRDI portal
Revision as of 20:09, 5 March 2024 by Import240305080343 (talk | contribs) (Created automatically from import240305080343)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:13705



swMATH961MaRDI QIDQ13705


No author found.





Related Items (only showing first 100 items - show all)

A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving\textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema}Unnamed ItemThe seventeen provers of the world. Foreword by Dana S. Scott..Intelligent computer mathematics. 10th international conference, CICM 2017, Edinburgh, UK, July 17--21, 2017. ProceedingsA refinement of de Bruijn's formal language of mathematicsA fully automatic theorem prover with human-style outputThe formalization of Vickrey auctions: a comparison of two approaches in Isabelle and TheoremaA heuristic prover for elementary analysis in \textit{Theorema}Theory exploration powered by deductive synthesisUnnamed ItemMathematical software -- ICMS 2016. 5th international conference, Berlin, Germany, July 11--14, 2016. ProceedingsEnabling Symbolic and Numerical Computations in HOL LightAutomated Reasoning in Reduction Rings Using the Theorema SystemTwo-Point Boundary Problems with One Mild Singularity and an Application to Graded Kirchhoff PlatesMechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniquesUnnamed ItemSymbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner BasesUnnamed Item\textit{Theorema}: Towards computer-aided mathematical theory explorationSAD as a mathematical assistant -- how should we go from here to there?Geometry constructions languageUnnamed ItemUnnamed ItemFormal and efficient primality proofs by use of computer algebra oraclesCommutative algebra in the Mizar systemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemA bi-directional extensible interface between Lean and MathematicaUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemAutomated theory exploration for interactive theorem proving: an introduction to the Hipster systemTransforming problems from analysis to algebra: a case study in linear boundary problemsLogic for programming, artificial intelligence, and reasoning. 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2--6, 2005. ProceedingsLocking-free compressible quadrilateral finite elements: Poisson's ratio-dependent vector interpolantsThe area method. A recapitulationConjecture synthesis for inductive theoriesRewriting techniques and applications. 14th international conference, RTA 2003, Valencia, Spain, June 9--11, 2003. ProceedingsUnnamed ItemFormal analysis of optical systemsA new symbolic method for solving linear two-point boundary value problems on the level of operatorsHidden verification for computational mathematicsLogicographic symbolsAn automated prover for Zermelo-Fraenkel set theory in TheoremaSolving equations with sequence variables and sequence functionsSynthesis of list algorithms by mechanical provingFormalizing polygonal knot origamiKnowledge-based proof planningUser interaction with the Matita proof assistantComputer algebra in scientific computing. 17th international workshop, CASC 2015, Aachen, Germany, September 14--18, 2015. ProceedingsUnnamed ItemUnnamed ItemUnnamed ItemHOL Light QEIncorporating quotation and evaluation into Church's type theorySynthesis of sorting algorithms using multisets in \textit{Theorema}Unnamed ItemUnnamed ItemUnnamed ItemIntelligent computer mathematics. 18th symposium, Calculemus 2011, and 10th international conference, MKM 2011, Bertinoro, Italy, July 18--23, 2011. ProceedingsDynamic Rippling, Middle-Out Reasoning and Lemma DiscoveryVariadic equational matching in associative and commutative theoriesProof–Based Synthesis of Sorting Algorithms for TreesFlat matchingMathematical software -- ICMS 2014. 4th international congress, Seoul, South Korea, August 5--9, 2014. ProceedingsVariadic equational matchingTowards specifying symbolic computationLemma discovery for induction. A surveyDesigning mathematical libraries based on requirements for theoremsMathematical Theory Exploration in Theorema: Reduction RingsInteractive Proving, Higher-Order Rewriting, and Theory Analysis in Theorema 2.0The GDML and EuKIM Projects: Short Report on the InitiativeThe RISC ProofNavigator: a proving assistant for program verification in the classroomVerified interactive computation of definite integralsMathLang Translation to Isabelle SyntaxUsing computer algebra techniques for the specification, verification and synthesis of recursive programsCombining logical and algebraic techniques for natural style proving in elementary analysisA Symbolic Framework for Operations on Linear Boundary ProblemsBuilding Mathematics-Based Software Systems to Advance Science and Create KnowledgeProof Documents for Automated Origami Theorem ProvingThousands 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 ACL2Pattern Unification with Sequence Variables and Flexible Arity SymbolsA Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction TheoryThe ForMaRE Project – Formal Mathematical Reasoning in EconomicsThe evidence algorithm and problems of representation and processing of mathematical computer knowledgeSolution lifting method for handling meta-variables in TH\(\exists\)OREM\(\forall\)A machine-checked implementation of Buchberger's algorithmGeoThms — a Web System for Euclidean Constructive GeometryPlatΩ: A Mediator between Text-Editors and Proof Assistance SystemsAlgorithms and proofs inheritance in the FOC languageComplexity Analysis of the Bivariate Buchberger Algorithm in Theorema


This page was built for software: Theorema