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


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.



External links

  • This entry has no external links. Add one.
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.


Added to PP

203 (#94,410)

6 months
54 (#76,058)

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

The emperor’s new mind.Roger Penrose - 1989 - Oxford University Press.
Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
Axiomatic Theories of Truth.Volker Halbach - 2010 - Cambridge, England: Cambridge University Press.
Human knowledge and the infinite regress of reasons.Peter D. Klein - 1999 - Philosophical Perspectives 13:297-325.

View all 19 references / Add more references