A mathematical theory of truth and an application to the regress problem

Nonlinear Studies 22 (2) (forthcoming)
Download Edit this record How to cite View on PhilPapers
In this paper a class of languages which are formal enough for mathematical reasoning is introduced. Its languages are called mathematically agreeable. Languages containing a given MA language L, and being sublanguages of L augmented by a monadic predicate, are constructed. A mathematical theory of truth (shortly MTT) is formulated for some of those languages. MTT makes them fully interpreted MA languages which posses their own truth predicates. MTT is shown to conform well with the eight norms formulated for theories of truth in the paper 'What Theories of Truth Should be Like (but Cannot be)', by Hannes Leitgeb. MTT is also free from infinite regress, providing a proper framework to study the regress problem. Main tools used in proofs are Zermelo-Fraenkel (ZF) set theory and classical logic.
PhilPapers/Archive ID
Upload history
First archival date: 2013-10-15
Latest version: 5 (2015-04-26)
View other versions
Added to PP index

Total views
193 ( #27,954 of 2,425,446 )

Recent downloads (6 months)
11 ( #47,400 of 2,425,446 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.