Back to Search
Start Over
An automated prover for Zermelo–Fraenkel set theory in Theorema
- Source :
-
Journal of Symbolic Computation . Mar2006, Vol. 41 Issue 3/4, p435-470. 36p. - Publication Year :
- 2006
-
Abstract
- 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. [Copyright &y& Elsevier]
- Subjects :
- *SET theory
*MATHEMATICS
*AGGREGATED data
*ANALYTIC sets
Subjects
Details
- Language :
- English
- ISSN :
- 07477171
- Volume :
- 41
- Issue :
- 3/4
- Database :
- Academic Search Index
- Journal :
- Journal of Symbolic Computation
- Publication Type :
- Academic Journal
- Accession number :
- 19308371
- Full Text :
- https://doi.org/10.1016/j.jsc.2005.04.013