Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying “x is true” and satisfying the “dequotation schema” for all sentences φ? This problem is investigated in the frame of Łukasiewicz infinitely valued logic.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
* Views captured on Cambridge Core between September 2016 - 27th May 2017. This data will be updated every 24 hours.