An automated prover for Zermelo-Fraenkel set theory in Theorema

  • Authors:
  • Wolfgang Windsteiger

  • Affiliations:
  • RISC Institute, A-4232 Hagenberg, Austria

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.