• Corpus ID: 118996546

Computer Algebra and Theorem Proving

@inproceedings{Ballarin1999ComputerAA,
  title={Computer Algebra and Theorem Proving},
  author={Clemens Ballarin},
  year={1999}
}
Is the use of computer algebra technology beneecial for mechanised reasoning in and about mathematical domains? Usually it is assumed that it is. Many works in this area, however, either have little reasoning content, or use symbolic computation only to simplify expressions. In work that has achieved more, the used methods do not scale up. They trust the computer algebra system either too much or too little. Computer algebra systems are not as rigorous as many provers. They are not logically… 

Series Robust Computer Algebra , Theorem Proving , and Oracle

TLDR
This manuscript examines existing question answering systems and argues that their high degree of architectural heterogeneity makes them poor candidates for rigorous analysis as oracles, and identifies computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics.

Automated methods for formal proofs in simple arithmetics and algebra

TLDR
This thesis investigates three integration paradigms and presents several proof procedures for universal and weak existential problems over rings, universal polynomial problems over the reals, quantifier elimination for parametric linear problems over ordered fields, Presburger arithmetic, mixed real-integer linear arithmetic, algebraically and real closed fields.

Razonamiento mecanizado en álgebra homológica

We face the problem of obtaining a certified version of a crucial algorithm in the field of Homological Algebra, known as "Perturbation Lemma". This lemma is intensively used in the software system

Reductionism and the Universal Calculus

In the seminal essay, “On the unreasonable effectiveness of mathematics in the physical sciences,” physicist Eugene Wigner poses a fundamental philosophical question concerning the relationship

An Idealistic Formalization of Stokes' Theorem: Pedagogical Math in Isabelle/ISAR

TLDR
The trials and tribulations of an attempt to formalize the n-dimensional version of Stokes’ theorem, aka the fundamental theorem of multivariate calculus, in Isabelle/HOL is described and an extension to Isabelle that manages predicate subtype information transparently is presented.

Trustable Communication Between Mathematics Systems

TLDR
This paper presents a rigorous, unified framework for facilitating communication between mathematics systems that is robust with respect to interface extension and can process requests for abstract services, where the server interface is not fully specified.

Validating QBF Validity in HOL4

TLDR
This work presents independent checking of certificates of validity based on Skolem functions in the HOL4 theorem prover, and provides high correctness assurances for Squolem’s claims of validity.

Formal verification of crossover operator in Genetic Algorithms using Prototype Verification System (PVS)

TLDR
This research formally proves a generalized version of the crossover operator of GA, specifying a multi-point crossover operator and its properties using PVS specification language, and proves the correctness of both the operators using proof assistant PVS.

A Page in Number Theory

We discuss the formalization, in the Matita Interactive Theorem Prover, of a few elementary results in number theory about the Moebius mu function and the Euler phi function.

Computer

Limits are reported on right-handed currents, based on precise measurement of the e+ spectrum end point in ~+ decay. Highly polarised muons from the TRIUMF "surface" beam were stopped in metal foils

References

SHOWING 1-10 OF 90 REFERENCES

Integrating Computer Algebra with Proof Planning

TLDR
This contribution presents an implementation which achieves this by adding a verbose mode to the computer algebra system which produces high-level protocol information that can be processed by an interface to derive proof plans.

Theorem Proving with the Real Numbers

TLDR
HOL extends Church's system by allowing also 'type variables' which give a form of polymorphism, and is capable not only of deciding whether it has a type, but inferring a most general type for it if it does.

Theorems and algorithms: an interface between Isabelle and Maple

TLDR
A prototype implementation of an interface between Isabelle and Maple isribes a new class of simpli(cid:12)cation rules called evaluation rules in order to make selected operations of Maple available, and without any modi( cid: 12)cation to the computer algebra system.

Enhancing the NUPRL Proof Development System and Applying it to Computational Abstract Algebra

This thesis describes substantial enhancements that were made to the software tools in the Nuprl system that are used to interactively guide the production of formal proofs. Over 20,000 lines of code

Analytica - A Theorem Prover in Mathematica

TLDR
This paper describes the structure of Analytica and explains the main techniques that it uses to construct proofs and illustrates the power of the theorem prover by several non-trivial examples including the basic properties of the stereographic projection and a series of three lemmas that lead to a proof of Weierstrass''s example of a continuous nowhere differentiable function.

Computers, Reasoning and Mathematical Practice

TLDR
Computer aided formal reasoning, mathematical assistants which check complex arguments and automated proofs of new and interesting mathematical results have been part of the dream of computational logic for many years, but it is still the case that few mathematicians use such programs, and their impact outside certain specialised communities has been less than might have been hoped.

A Higher-Order Implementation of Rewriting

Building a Computer Algebra Environment by Composition of Collaborative Tools

TLDR
The approach consists of building the environment by composition of separately developed packages, using state of the art software engineering technologies in the spirit of the tool integration paradigm, so that the different software components should be able to exchange data and freely cooperate with each other, without being too tightly coupled as in a monolithic system.

AXIOM: the scientific computation system

TLDR
This book gives the reader a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms newly developed by the symbolic computation community, and presents advanced programming and problem solving techniques.

Design and implementation of symbolic computation systems : International Symposium DISCO '90, Capri, Italy, April 10-12, 1990, proceedings

TLDR
The design of cayley - a language for modern algebra and the design and development of ENprover, an automated theorem proving system based on EN-strategy are discussed.
...