A theory of truth for a class of mathematical languages and an application

Download Edit this record How to cite View on PhilPapers
In this paprer a class of so called mathematically acceptable (shortly MA) languages is introduced First-order formal languages containing natural numbers and numerals belong to that class. MA languages which are contained in a given fully interpreted MA language augmented by a monadic predicate are constructed. A mathematical theory of truth (shortly MTT) is formulated for some of these languages. MTT makes them fully interpreted MA languages which posses their own truth predicates, yielding consequences to philosophy of mathematics. MTT is shown to conform well with the eight norms presented 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.
PhilPapers/Archive ID
Upload history
Archival date: 2014-11-10
View other versions
Added to PP index

Total views
78 ( #37,309 of 51,277 )

Recent downloads (6 months)
8 ( #43,140 of 51,277 )

How can I increase my downloads?

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