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.
| Item Type: | Journal article |
|---|---|
| Faculties: | Philosophy, Philosophy of Science and Religious Science |
| Subjects: | 100 Philosophy and Psychology > 100 Philosophy |
| ISSN: | 0022-3611 |
| Language: | English |
| Item ID: | 81797 |
| Date Deposited: | 15. Dec 2021, 14:59 |
| Last Modified: | 15. Dec 2021, 14:59 |
Actions (login required)
- View Item
