Type of Publication: | Journal article |
Publication status: | Published |
URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-2-1wnm6nc71ht7d9 |
Author: | Campbell-Moore, Catrin; Horsten, Leon; Leitgeb, Hannes |
Year of publication: | 2019 |
Published in: | Journal of Philosophical Logic ; 48 (2019), 1. - pp. 87-112. - Springer Science+Business Media B.V.. - ISSN 0022-3611. - eISSN 1573-0433 |
DOI (citable link): | https://dx.doi.org/10.1007/s10992-018-9475-0 |
Summary: |
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 φ equals the probability that φ is true.
|
Subject (DDC): | 100 Philosophy |
Keywords: | Liar paradox, semantic paradox, revision theory of thruth, probabilistic convention T |
Link to License: | Attribution 4.0 International |
Bibliography of Konstanz: | Yes |
Refereed: | Yes |
CAMPBELL-MOORE, Catrin, Leon HORSTEN, Hannes LEITGEB, 2019. Probability for the Revision Theory of Truth. In: Journal of Philosophical Logic. Springer Science+Business Media B.V.. 48(1), pp. 87-112. ISSN 0022-3611. eISSN 1573-0433. Available under: doi: 10.1007/s10992-018-9475-0
@article{CampbellMoore2019-02Proba-48666, title={Probability for the Revision Theory of Truth}, year={2019}, doi={10.1007/s10992-018-9475-0}, number={1}, volume={48}, issn={0022-3611}, journal={Journal of Philosophical Logic}, pages={87--112}, author={Campbell-Moore, Catrin and Horsten, Leon and Leitgeb, Hannes} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/48666"> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Campbell-Moore, Catrin</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-02-17T10:52:05Z</dcterms:available> <dc:contributor>Leitgeb, Hannes</dc:contributor> <dc:language>eng</dc:language> <dc:contributor>Campbell-Moore, Catrin</dc:contributor> <dcterms:title>Probability for the Revision Theory of Truth</dcterms:title> <dc:rights>Attribution 4.0 International</dc:rights> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/48666/1/Campbell-Moore_2-1wnm6nc71ht7d9.pdf"/> <dcterms:issued>2019-02</dcterms:issued> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/48666/1/Campbell-Moore_2-1wnm6nc71ht7d9.pdf"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-02-17T10:52:05Z</dc:date> <dc:creator>Leitgeb, Hannes</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/48666"/> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dcterms:abstract xml:lang="eng">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 φ equals the probability that φ is true.</dcterms:abstract> <dc:contributor>Horsten, Leon</dc:contributor> <dc:creator>Horsten, Leon</dc:creator> </rdf:Description> </rdf:RDF>
Campbell-Moore_2-1wnm6nc71ht7d9.pdf | 101 |