Everything is learnable, once it is settled.
Since Fitch's proof that not all propositions are knowable, philosophers have analysed the concept of knowability and sought a schema for the knowable propositions. A recent development in dynamic epistemic logic (DEL) has been to read 'knowable' as 'known after an announcement'. Arbitrary Public An...
| Publicado en: | Synthese Vol. 199; no. 1/2; pp. 4795 - 4818 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Dec2021
|
| 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=153650987&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 153650987 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00397857 4LI jtl: Synthese issn: 00397857 maglogo: N pubinfo: dt: Dec2021 vid: 199 iid: 1/2 pid: 237 pub: Springer Nature artinfo: ui: 153650987 10.1007/s11229-020-03003-5 ppf: 4795 ppct: 23 formats: fmt: – @attributes: type: T – @attributes: type: P size: 412KB tig: atl: Everything is learnable, once it is settled. aug: au: Xu, Kevin affil: London, England su: Epistemic logic Philosophers Logic sug: subj: Epistemic logic Philosophers Logic keyword: Dynamic epistemic logic Fitch's paradox of knowability Moorean announcements Sequential epistemic logic Temporal logic ab: Since Fitch's proof that not all propositions are knowable, philosophers have analysed the concept of knowability and sought a schema for the knowable propositions. A recent development in dynamic epistemic logic (DEL) has been to read 'knowable' as 'known after an announcement'. Arbitrary Public Announcement Logic (APAL) and Sequential Public Announcement Logic (SPAL) are two DELs that have depicted this reading of knowability. We argue that neither APAL nor SPAL provide a satisfactory and principled schema of the knowable propositions. Instead, we claim that knowability is linked with settledness; stability of truth. We augment SPAL with a settled operator to create a new logic, Dual Sequential Public Announcement Logic (DSPAL). We prove in DSPAL a principled schema of knowability, that all settled propositions are knowable. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Synthese is a copyright of Springer, 2021. All Rights Reserved. item: Synthese holder: Springer Nature dt: @attributes: year: 2021 holdings: @attributes: islocal: N |
|---|