pith. sign in

arxiv: 1708.00317 · v9 · pith:KGGX3PPYnew · submitted 2017-07-29 · 🧮 math.LO

A mathematically derived definitional/semantical theory of truth

classification 🧮 math.LO
keywords languagetruthinterpretationinterpretedtheoryformulafullyobject
0
0 comments X
read the original abstract

Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation. This interpretation is equivalent to the interpretation by meanings of sentences if the object language is so interpreted. The added formula provides a truth predicate for the constructed language. The so obtained theory of truth satisfies the norms presented in Hannes Leitgeb's paper 'What Theories of Truth Should be Like (but Cannot be)'.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.