Abstract
We investigate how to assign probabilities to sentences that contain a type-free truth predicate. These probability values track how often a sentence is satisfied in transfinite revision sequences, following Gupta and Belnap's revision theory of truth. This answers an open problem by Leitgeb which asks how one might describe transfinite stages of the revision sequence using such probability functions. We offer a general construction, and explore additional constraints that lead to desirable properties of the resulting probability function. One such property is Leitgeb's Probabilistic Convention T, which says that the probability of phi equals the probability that phi is true.
| Dokumententyp: | Zeitschriftenartikel |
|---|---|
| Fakultät: | Philosophie, Wissenschaftstheorie und Religionswissenschaft |
| Themengebiete: | 100 Philosophie und Psychologie > 100 Philosophie |
| ISSN: | 0022-3611 |
| Sprache: | Englisch |
| Dokumenten ID: | 81797 |
| Datum der Veröffentlichung auf Open Access LMU: | 15. Dez. 2021, 14:59 |
| Letzte Änderungen: | 15. Dez. 2021, 14:59 |
- Dokument bearbeiten
