Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können am Montag, 6.2. und Dienstag, 7.2. keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted on Monday, Feb. 6 and Tuesday, Feb. 7.)
Type of Publication:  Journal article 
Publication status:  Published 
Author:  Raidl, Eric 
Year of publication:  2019 
Published in:  Journal of Logic, Language and Information ; 28 (2019), 4.  pp. 515549.  ISSN 09258531.  eISSN 15729583 
DOI (citable link):  https://dx.doi.org/10.1007/s10849019092890 
Summary: 
According to Stalnaker’s Thesis (S), the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does (S) still lead to triviality, if the probability function in (S) is replaced by a probabilitylike function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: (1) Adams’ thesis, where the probability function on the left in (S) is replaced by a probabilitylike function, (2) abandoning conditionalisation, where probability conditionalisation on the right in (S) is replaced by another propositional update procedure and (3) the approximation thesis, where equality in (S) is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’.

Subject (DDC):  100 Philosophy 
Bibliography of Konstanz:  Yes 
Refereed:  Yes 
Files  Size  Format  View 

There are no files associated with this item. 
RAIDL, Eric, 2019. Lewis' Triviality for Quasi Probabilities. In: Journal of Logic, Language and Information. 28(4), pp. 515549. ISSN 09258531. eISSN 15729583. Available under: doi: 10.1007/s10849019092890
@article{Raidl201912Lewis47929, title={Lewis' Triviality for Quasi Probabilities}, year={2019}, doi={10.1007/s10849019092890}, number={4}, volume={28}, issn={09258531}, journal={Journal of Logic, Language and Information}, pages={515549}, author={Raidl, Eric} }
<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/22rdfsyntaxns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digitalrepositories.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.unikonstanz.de/rdf/resource/123456789/47929"> <bibo:uri rdf:resource="https://kops.unikonstanz.de/handle/123456789/47929"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:isPartOfCollection rdf:resource="https://kops.unikonstanz.de/rdf/resource/123456789/40"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">20191210T08:58:01Z</dc:date> <dc:creator>Raidl, Eric</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.unikonstanz.de/rdf/resource/123456789/40"/> <dcterms:abstract xml:lang="eng">According to Stalnaker’s Thesis (S), the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does (S) still lead to triviality, if the probability function in (S) is replaced by a probabilitylike function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: (1) Adams’ thesis, where the probability function on the left in (S) is replaced by a probabilitylike function, (2) abandoning conditionalisation, where probability conditionalisation on the right in (S) is replaced by another propositional update procedure and (3) the approximation thesis, where equality in (S) is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">20191210T08:58:01Z</dcterms:available> <dcterms:issued>201912</dcterms:issued> <dc:language>eng</dc:language> <dcterms:title>Lewis' Triviality for Quasi Probabilities</dcterms:title> <dc:contributor>Raidl, Eric</dc:contributor> </rdf:Description> </rdf:RDF>