A hierarchy of languages, logics, and mathematical theories

Abstract

We present mathematics from a foundational perspective as a hierarchy in which each tier consists of a language, a logic, and a mathematical theory. Each tier in the hierarchy subsumes all preceding tiers in the sense that its language, logic, and mathematical theory generalize all preceding languages, logics, and mathematical theories. Starting from the root tier, the mathematical theories in this hierarchy are: combinatory logic restricted to the identity I, combinatory logic, ZFC set theory, constructive type theory, and category theory. The languages of the first four tiers correspond to the languages of the Chomsky hierarchy: in combinatory logic Ix = x gives rise to a regular language; the language generated by S, K in combinatory logic is context-free; first-order logic is context-sensitive; and the typed lambda calculus of type theory is recursively enumerable. The logic of each tier can be characterized in terms of the cardinality of the set of its truth values: combinatory logic restricted to I has 0 truth values, while combinatory logic has 1, first-order logic 2, constructive type theory 3, and categeory theory omega_0. We conjecture that the cardinality of objects whose existence can be established in each tier is bounded; for example, combinatory logic is bounded in this sense by omega_0 and ZFC set theory by the least inaccessible cardinal. We also show that classical recursion theory presents a framework for generating the above hierarchy in terms of the initial functions zero, projection, and successor followed by composition and m-recursion, starting with the zero function I in combinatory logic This paper begins with a theory of glossogenesis, i.e. a theory of the origin of language, since this theory shows that natural language has deep connections to category theory and since it was through these connections that the last tier and ultimately the whole hierarchy were discovered. The discussion covers implications of the hierarchy for mathematics, physics, cosmology, theology, linguistics, extraterrestrial communication, and artificial intelligence.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Diagonal fixed points in algebraic recursion theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.
Constructive set theoretic models of typed combinatory logic.Andreas Knobel - 1993 - Journal of Symbolic Logic 58 (1):99-118.
Predicate calculus and naive set theory in pure combinatory logic.M. W. Bunder - 1981 - Archive for Mathematical Logic 21 (1):169-177.
Category theory based on combinatory logic.M. W. Bunder - 1984 - Archive for Mathematical Logic 24 (1):1-16.
The Church-Rosser property in symmetric combinatory logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536-556.
Set theory based on combinatory logic.Maarten Wicher Visser Bunder - 1969 - Groningen,: V. R. B. --Offsetdrukkerij (Kleine der A 3-4).
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.

Analytics

Added to PP
2009-01-28

Downloads
60 (#92,080)

6 months
7 (#1,397,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references