A theorem prover for elementary set theory

  • Authors:

  • F. M. Brown

  • Affiliations:

  • Department of Artificial Intelligence, University of Edinburgh, Scotland

  • Venue:
  • IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a theorem prover for elementary set theory which is based on truth value preserving transformations, and then give an example of the protocol produced by this system when trying to prove the theorem of set theory known as Cantor's Theorem.