A Theorem Prover for Elementary Set Theory
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.
Cite
Text
Brown. "A Theorem Prover for Elementary Set Theory." International Joint Conference on Artificial Intelligence, 1977.Markdown
[Brown. "A Theorem Prover for Elementary Set Theory." International Joint Conference on Artificial Intelligence, 1977.](https://mlanthology.org/ijcai/1977/brown1977ijcai-theorem/)BibTeX
@inproceedings{brown1977ijcai-theorem,
title = {{A Theorem Prover for Elementary Set Theory}},
author = {Brown, Frank M.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1977},
pages = {534-540},
url = {https://mlanthology.org/ijcai/1977/brown1977ijcai-theorem/}
}