Abstract
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the Theorema system. The method applies the ``Prove-Compute-Solve''-paradigm as its major strategy for generating proofs in a natural style for statements involving constructs from set theory
| Original language | English |
|---|---|
| Pages (from-to) | 435-470 |
| Number of pages | 36 |
| Journal | Journal of Symbolic Computation |
| Volume | 41 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - Mar 2006 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics