Assertoric Semantics and the Computational Power of Self-Referential Truth.
There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless. The philosophical contribution of this paper is to put this convicti...
| Publicado en: | Journal of Philosophical Logic Vol. 41; no. 2; pp. 317 - 346 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Apr2012
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=73278092&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 73278092 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00223611 JPH jtl: Journal of Philosophical Logic issn: 00223611 maglogo: N pubinfo: dt: Apr2012 vid: 41 iid: 2 pid: 237 pub: Springer Nature artinfo: ui: 73278092 10.1007/s10992-010-9162-2 ppf: 317 ppct: 29 formats: fmt: @attributes: type: P size: 507KB tig: atl: Assertoric Semantics and the Computational Power of Self-Referential Truth. aug: au: Wintein, Stefan affil: Department of Philosophy and TilPS (Tilburg Institute for Logic and Philosophy of Science), Tilburg University, Dante building, room 230 5000 Tilburg The Netherlands su: Semantics Computational intelligence Autopoiesis Truth Sentences (Grammar) Liar paradox Query languages (Computer science) sug: subj: Semantics Computational intelligence Autopoiesis Truth Sentences (Grammar) Liar paradox Query languages (Computer science) keyword: Inferential semantics Information retrieval Self-referential truth ab: There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless. The philosophical contribution of this paper is to put this conviction into question. Using the framework of assertoric semantics, which is a semantic valuation method for languages of self-referential truth that has been developed by the author, we show that certain computational problems, called query structures, can be solved more efficiently by an agent who has self-referential resources (amongst which are Liar sentences) than by an agent who has only classical resources; we establish the computational power of self-referential truth. The paper concludes with some thoughts on the implications of the established result for deflationary accounts of truth. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Journal of Philosophical Logic is a copyright of Springer, 2012. All Rights Reserved. item: Journal of Philosophical Logic holder: Springer Nature dt: @attributes: year: 2012 holdings: @attributes: islocal: N |
|---|