Provability with Minimal Type Theory

Abstract

Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to each other (in 2D space) when this expression is formalized using a directed acyclic graph (DAG). This provides substantially greater expressiveness than the 1D space of FOPL syntax. The increase in expressiveness over other formal systems of logic shows the Pathological Self-Reference Error of expressions previously considered to be sentences of formal systems. MTT shows that these expressions were never truth bearers, thus never sentences of any formal logic system.

Author's Profile

Analytics

Added to PP
2017-06-28

Downloads
298 (#47,976)

6 months
58 (#65,808)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?