The Liar Paradox and Fuzzy Logic
Hajek, Petr ; Paris, Jeff ; Shepherdson, John
J. Symbolic Logic, Tome 65 (2000) no. 1, p. 339-346 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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 $\varphi$? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.
Publié le : 2000-03-14
Classification:  
@article{1183746025,
     author = {Hajek, Petr and Paris, Jeff and Shepherdson, John},
     title = {The Liar Paradox and Fuzzy Logic},
     journal = {J. Symbolic Logic},
     volume = {65},
     number = {1},
     year = {2000},
     pages = { 339-346},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746025}
}

Hajek, Petr; Paris, Jeff; Shepherdson, John. The Liar Paradox and Fuzzy Logic. J. Symbolic Logic, Tome 65 (2000) no. 1, pp.  339-346. http://gdmltest.u-ga.fr/item/1183746025/