Formalising Mathematics In Simple Type Theory

04/20/2018
by   Lawrence C. Paulson, et al.
0

Despite the considerable interest in new dependent type theories, simple type theory (which dates from 1940) is sufficient to formalise serious topics in mathematics. This point is seen by examining formal proofs of a theorem about stereographic projections. A formalisation using the HOL Light proof assistant is contrasted with one using Isabelle/HOL. Harrison's technique for formalising Euclidean spaces is contrasted with an approach using Isabelle/HOL's axiomatic type classes. However, every formal system can be outgrown, and mathematics should be formalised with a view that it will eventually migrate to a new formalism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/11/2021

Should Type Theory replace Set Theory as the Foundation of Mathematics

We discuss why Type Theory is preferable as foundation of Mathematics co...
research
02/17/2021

Formalizing relations in type theory

Type theory plays an important role in foundations of mathematics as a f...
research
12/16/2019

Quantum GestART: Identifying and Applying Correlations between Mathematics, Art, and Perceptual Organization

Mathematics can help analyze the arts and inspire new artwork. Mathemati...
research
04/04/2023

Introduction to Pylog

PyLog is a minimal experimental proof assistant based on linearised natu...
research
09/13/2023

Towards solid abelian groups: A formal proof of Nöbeling's theorem

Condensed mathematics, developed by Clausen and Scholze over the last fe...
research
05/09/2023

Pure Data Foundation of Mathematics and Computing

We propose an axiomatic foundation of mathematics based on the finite se...
research
01/01/2021

Formalizing Hall's Marriage Theorem in Lean

We formalize Hall's Marriage Theorem in the Lean theorem prover for incl...

Please sign up or login with your details

Forgot password? Click here to reset