The liar paradox and fuzzy logic

Journal of Symbolic Logic 65 (1):339-346 (2000)
Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}(\bar{\varphi})$ for all sentences φ? This problem is investigated in the frame of Lukasiewicz infinitely valued logic
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586541
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,865
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Hannes Leitgeb (2008). On the Probabilistic Convention T. Review of Symbolic Logic 1 (2):218-224.

View all 9 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

32 ( #98,631 of 1,724,878 )

Recent downloads (6 months)

6 ( #110,368 of 1,724,878 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.