DeepAI AI Chat
Log In Sign Up

MathZero, The Classification Problem, and Set-Theoretic Type Theory

by   David McAllester, et al.

AlphaZero learns to play go, chess and shogi at a superhuman level through self play given only the rules of the game. This raises the question of whether a similar thing could be done for mathematics – a MathZero. MathZero would require a formal foundation and an objective. We propose the foundation of set-theoretic dependent type theory and an objective defined in terms of the classification problem – the problem of classifying concept instances up to isomorphism. The natural numbers arise as the solution to the classification problem for finite sets. Here we generalize classical Bourbaki set-theoretic isomorphism to set-theoretic dependent type theory. To our knowledge we give the first isomorphism inference rules for set-theoretic dependent type theory with propositional set-theoretic equality. The presentation is intended to be accessible to mathematicians with no prior exposure to type theory.


page 1

page 2

page 3

page 4


Should Type Theory replace Set Theory as the Foundation of Mathematics

We discuss why Type Theory is preferable as foundation of Mathematics co...

Quadratic type checking for objective type theory

We introduce a modification of standard Martin-Lof type theory in which ...

Pure Data Foundation of Mathematics and Computing

We propose an axiomatic foundation of mathematics based on the finite se...

Towards a theory of granular sets

Motivated by the application problem of sensor fusion the author introdu...

A Set Theoretic Approach for Knowledge Representation: the Representation Part

In this paper, we propose a set theoretic approach for knowledge represe...

Equivariant ZFA and the foundations of nominal techniques

We give an accessible presentation to the foundations of nominal techniq...

An Implementation of Homotopy Type Theory in Isabelle/Pure

In this Masters thesis we present an implementation of a fragment of "bo...