A Theorem Prover for Elementary Set Theory

Brown, Frank M.

A Theorem Prover for Elementary Set Theory

Download BibTeX Cite

Proceedings of the Fifth International Joint Conference on Artificial Intelligence. Theorem Proving. Pages 534-539.

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.

Frank M. Brown. 1977. A Theorem Prover for Elementary Set Theory. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, IJCAI-77. IJCAI, 534–539. https://ijcai.org/proceedings/1977/122

@inproceedings{ijcai1977p122,
  title     = {A Theorem Prover for Elementary Set Theory},
  author    = {Brown, Frank M.},
  booktitle = {Proceedings of the Fifth International Joint Conference on
               Artificial Intelligence, {IJCAI-77}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Raj Reddy},
  pages     = {534--539},
  year      = {1977},
  note      = {Theorem Proving},
  url       = {https://ijcai.org/proceedings/1977/122},
}

TY  - CPAPER
TI  - A Theorem Prover for Elementary Set Theory
AU  - Brown, Frank M.
T2  - Proceedings of the Fifth International Joint Conference on Artificial Intelligence, IJCAI-77
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1977
SP  - 534
EP  - 539
UR  - https://ijcai.org/proceedings/1977/122
ER  -