Understanding Set Theory with Types

Set theory is fundamental to modern mathematics, but its precise nature remains debated. Many equate set theory with the Zermelo-Fraenkel (ZF) framework, which assumes everything can be built within sets. However, this perspective faces criticism and alternatives, such as type theory, which offer different foundations.

Traditionally, before the 1980s, “type theory” referred mainly to higher-order logic and related logical systems. In 1973, NG de Bruijn authored a paper titled “Set Theory with Type Restrictions,” aimed at motivating the development of automated theorem proving languages like AUTOMATH, which rely on dependent types. His insights remain relevant, emphasizing the need for more nuanced foundations.

De Bruijn argued that the widespread belief that all mathematics is based on set theory, particularly ZF, might be flawed. He noted a growing movement against viewing everything as a set, partly fueled by educational trends that introduced set concepts early in school. His concern was that the idea of “all is set” leads to paradoxes and complexity, such as Russell’s paradox, and overly complicated coding tricks, like representing ordered pairs and numbers internally as sets.

He criticized ZF’s approach for being too broad and disconnected from intuitive mathematical practice. In everyday reasoning, mathematicians often think in terms of collections belonging to specific types or classes, not just sets. For example, the intersection of a rational number and a set of points in a plane intuitively makes no sense if everything must be encoded as a set.

De Bruijn’s view advocates for a more straightforward approach: think of sets as collections of objects of a given type, aligning better with practical applications like those in proof assistants such as Isabelle/HOL. He also expresses skepticism about the size and complexity of ZF, which includes enormous and inaccessible sets, like large infinities outside normal mathematical use.

In summary, de Bruijn suggests that foundational systems should reflect more natural, type-based structures rather than the all-encompassing, sometimes paradoxical universe of traditional set theory. His work encourages exploring foundations that are both simpler and closer to everyday mathematical intuition.

FAQs

What is the main difference between set theory and type theory?
Set theory is based on the idea that everything can be modeled as a collection of objects called sets. Type theory organizes objects into types or classes, limiting what kinds of objects can belong to each other, which can simplify logical foundations.

Why do some mathematicians oppose traditional set theory?
Critics argue that set theory, especially ZF, is overly large and complex, leading to paradoxes and abstract coding tricks. They prefer type-based approaches that are more aligned with practical mathematics and avoid these issues.

How does type theory benefit formal proof systems?
Type theory offers a more intuitive, structured foundation for proof assistants like Isabelle/HOL, making formal verification more accessible and closer to conventional mathematical reasoning.

Is set theory still relevant today?
Yes, but it is increasingly supplemented or replaced by type theory in certain areas, especially in formal logic and computer-assisted proofs, to provide clearer, more manageable foundations.