A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An automated prover for Zermelo–Fraenkel set theory in Theorema
2006
Journal of symbolic computation
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.
doi:10.1016/j.jsc.2005.04.013
fatcat:u6hy66okqvcypmjm7sifbyyg3i