DeepAI AI Chat
Log In Sign Up

Pure Data Foundation of Mathematics and Computing

by   Saul Youssef, et al.

We propose an axiomatic foundation of mathematics based on the finite sequence as the foundational concept, rather than based on logic and set, as in set theory, or based on type as in dependent type theories. Finite sequences lead to a concept of pure data, which is used to represent all mathematical objects. As an axiomatic system, the foundation has only one axiom which defines what constitutes a valid definition. Using the axiom, an internal true/false/undecided valued logic and an internal language are defined, making logic and language-related axioms unnecessary. Valid proof and valid computation are defined in terms of equality of pure data. An algebra of pure data leads to a rich theory of spaces and morphisms which play a role similar to the role of Category Theory in modern Mathematics. As applications, we explore Mathematical Machine Learning, the consistency of Mathematics and address paradoxes due to Godel, Berry, Curry and Yablo.


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...

An Implementation of Homotopy Type Theory in Isabelle/Pure

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

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

AlphaZero learns to play go, chess and shogi at a superhuman level throu...

Formalising Mathematics In Simple Type Theory

Despite the considerable interest in new dependent type theories, simple...

Adding an Abstraction Barrier to ZF Set Theory

Much mathematical writing exists that is, explicitly or implicitly, base...

Explaining SDN Failures via Axiomatisations

This work introduces a concept of explanations with respect to the viola...

Programs as the Language of Science

Currently it is widely accepted that the language of science is mathemat...