Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

TCS

2016

2016

This paper presents a substantially simpliﬁed axiomatization of Map Theory and proves the consistency of this axiomatization (called MT) in ZFC under the assumption that there exists an inaccessible ordinal. Map Theory axiomatizes lambda calculus plus Hilbert’s epsilon operator. All theorems of ZFC set theory including the axiom of foundation are provable in Map Theory, and if one omits Hilbert’s epsilon operator from Map Theory then one is left with a computer programming language. Map Theory fulﬁlls Church’s original aim of lambda calculus. Map Theory is suited for reasoning about classical mathematics as well as computer programs. Furthermore, Map Theory is suited for eliminating the barrier between classical mathematics and computer science rather than just supporting the two ﬁelds side by side. Map Theory axiomatizes a universe of “maps”, some of which are “wellfounded”. The class of wellfounded maps in Map Theory corresponds to the universe of sets in ZFC. Th...

Related Content

Added |
10 Apr 2016 |

Updated |
10 Apr 2016 |

Type |
Journal |

Year |
2016 |

Where |
TCS |

Authors |
Chantal Berline, Klaus Grue |

Comments (0)