## STMM: A Set Theory for Mechanized Mathematics (2000)

### Cached

### Download Links

- [imps.mcmaster.ca]
- [imps.mcmaster.ca]
- [imps.mcmaster.ca]
- DBLP

### Other Repositories/Bibliography

Venue: | JOURNAL OF AUTOMATED REASONING |

Citations: | 12 - 6 self |

### BibTeX

@ARTICLE{Farmer00stmm:a,

author = {William M. Farmer},

title = {STMM: A Set Theory for Mechanized Mathematics},

journal = {JOURNAL OF AUTOMATED REASONING},

year = {2000},

volume = {26},

pages = {2001}

}

### OpenURL

### Abstract

Although set theory is the most popular foundation for mathematics, not many mechanized mathematics systems are based on set theory. Zermelo-Fraenkel (zf) set theory and other traditional set theories are not an adequate foundation for mechanized mathematics. stmm is a version of von-Neumann-Bernays-Gödel (nbg) set theory that is intended to be a Set Theory for Mechanized Mathematics. stmm allows terms to denote proper classes and to be undened, has a denite description operator, provides a sort system for classifying terms by value, and includes lambda-notation with term constructors for function application and function abstraction. This paper describes stmm and discusses why it is a good foundation for mechanized mathematics.