{"id":{"repo_id":"milano","oai_identifier":"oai:air.unimi.it:2434/1226715"},"canonical_url":"https://search.dev.ndltd.org/etd/milano/oai:air.unimi.it:2434/1226715","repository":{"repo_id":"milano","name":"Università degli Studi di Milano","base_url":"https://air.unimi.it/oai/request"},"display":{"title":"The Other Option","abstract":"Hanti Lin and Kevin Kelly [LK12] introduce a way of relating probability functions and binary beliefs, referred to as odds-threshold method, which is based on comparing the probabilities of the elementary outcomes. Outcome o1 is preferred to outcome o2 if o1 is sufficiently more likely than o2; the agent’s belief-set is the set of mostly preferred outcomes. As main contribution, we give a probability-independent definition of the preferential orders generated by the odds-threshold method. This allows for a logical characterization of the belief revision properties induced on binary beliefs by Jeffrey conditioning (JC) on a piece of evidence. Specifically, we show that if JC is assumed to be successful – namely, the evidence is implied by the belief-set induced by the posterior probability – then the corresponding belief revision on binary beliefs satisfies all the rules of the nonmonotonic system P together with Disjunctive Rationality [Fre93] and a new rule named Plausible Monotonicity. As JC does not require the evidence to be certain, we also considered rules for iterated belief revision. In the case of successful JC, the induced iterated belief revision satisfies the rules (C1), (C2) and (C3), proposed by Darwiche and Pearl [DP97]. In addition, if JC is also assumed to be confirmatory – i.e. the posterior probability of the evidence is strictly greater than its prior – then the rule (C4) is satisfied as well.","abstract_html":"Hanti Lin and Kevin Kelly [LK12] introduce a way of relating probability functions and binary beliefs, referred to as odds-threshold method, which is based on comparing the probabilities of the elementary outcomes. Outcome o1 is preferred to outcome o2 if o1 is sufficiently more likely than o2; the agent’s belief-set is the set of mostly preferred outcomes. As main contribution, we give a probability-independent definition of the preferential orders generated by the odds-threshold method. This allows for a logical characterization of the belief revision properties induced on binary beliefs by Jeffrey conditioning (JC) on a piece of evidence. Specifically, we show that if JC is assumed to be successful – namely, the evidence is implied by the belief-set induced by the posterior probability – then the corresponding belief revision on binary beliefs satisfies all the rules of the nonmonotonic system P together with Disjunctive Rationality [Fre93] and a new rule named Plausible Monotonicity. As JC does not require the evidence to be certain, we also considered rules for iterated belief revision. In the case of successful JC, the induced iterated belief revision satisfies the rules (C1), (C2) and (C3), proposed by Darwiche and Pearl [DP97]. In addition, if JC is also assumed to be confirmatory – i.e. the posterior probability of the evidence is strictly greater than its prior – then the rule (C4) is satisfied as well.","abstract_has_math":false,"creators":["DUCA, GIOVANNI"],"institution":"Università degli Studi di Milano","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["tutor: H. Hosni ; co-tutor: M. Piazza ; coordinatore: F. Guala","Piazza","Mario","G. Duca","GUALA, FRANCESCO"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026-03-25","date_published":"2026-03-25","updated_at":"2026-07-27T20:19:03Z","subjects":["Settore PHIL-02/A - Logica e filosofia della scienza"],"languages":["eng"],"rights":["info:eu-repo/semantics/openAccess","license:Creative commons","license uri:http://creativecommons.org/licenses/by-sa/4.0/"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2434/1226715","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["tutor: H. Hosni ; co-tutor: M. Piazza ; coordinatore: F. Guala","Piazza","Mario","G. Duca","GUALA, FRANCESCO"]},{"key":"dc:creator","label":"Author","values":["DUCA, GIOVANNI"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026-03-25"]},{"key":"dc:publisher","label":"Institution","values":["Università degli Studi di Milano"]},{"key":"dc:relation","label":"Dc Relation","values":["numberofpages:140","alleditors:Piazza, Mario"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/doctoralThesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Settore PHIL-02/A - Logica e filosofia della scienza"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess","license:Creative commons","license uri:http://creativecommons.org/licenses/by-sa/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2434/1226715"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Hanti Lin and Kevin Kelly [LK12] introduce a way of relating probability functions and binary beliefs, referred to as odds-threshold method, which is based on comparing the probabilities of the elementary outcomes. Outcome o1 is preferred to outcome o2 if o1 is sufficiently more likely than o2; the agent’s belief-set is the set of mostly preferred outcomes. As main contribution, we give a probability-independent definition of the preferential orders generated by the odds-threshold method. This allows for a logical characterization of the belief revision properties induced on binary beliefs by Jeffrey conditioning (JC) on a piece of evidence. Specifically, we show that if JC is assumed to be successful – namely, the evidence is implied by the belief-set induced by the posterior probability – then the corresponding belief revision on binary beliefs satisfies all the rules of the nonmonotonic system P together with Disjunctive Rationality [Fre93] and a new rule named Plausible Monotonicity. As JC does not require the evidence to be certain, we also considered rules for iterated belief revision. In the case of successful JC, the induced iterated belief revision satisfies the rules (C1), (C2) and (C3), proposed by Darwiche and Pearl [DP97]. In addition, if JC is also assumed to be confirmatory – i.e. the posterior probability of the evidence is strictly greater than its prior – then the rule (C4) is satisfied as well."]},{"key":"dc:title","label":"Title","values":["The Other Option"]}]}],"canonical_facts":{"dc:contributor":["tutor: H. Hosni ; co-tutor: M. Piazza ; coordinatore: F. Guala","Piazza","Mario","G. Duca","GUALA, FRANCESCO"],"dc:creator":["DUCA, GIOVANNI"],"dc:date":["2026-03-25"],"dc:description":["Hanti Lin and Kevin Kelly [LK12] introduce a way of relating probability functions and binary beliefs, referred to as odds-threshold method, which is based on comparing the probabilities of the elementary outcomes. Outcome o1 is preferred to outcome o2 if o1 is sufficiently more likely than o2; the agent’s belief-set is the set of mostly preferred outcomes. As main contribution, we give a probability-independent definition of the preferential orders generated by the odds-threshold method. This allows for a logical characterization of the belief revision properties induced on binary beliefs by Jeffrey conditioning (JC) on a piece of evidence. Specifically, we show that if JC is assumed to be successful – namely, the evidence is implied by the belief-set induced by the posterior probability – then the corresponding belief revision on binary beliefs satisfies all the rules of the nonmonotonic system P together with Disjunctive Rationality [Fre93] and a new rule named Plausible Monotonicity. As JC does not require the evidence to be certain, we also considered rules for iterated belief revision. In the case of successful JC, the induced iterated belief revision satisfies the rules (C1), (C2) and (C3), proposed by Darwiche and Pearl [DP97]. In addition, if JC is also assumed to be confirmatory – i.e. the posterior probability of the evidence is strictly greater than its prior – then the rule (C4) is satisfied as well."],"dc:identifier":["https://hdl.handle.net/2434/1226715"],"dc:language":["eng"],"dc:publisher":["Università degli Studi di Milano"],"dc:relation":["numberofpages:140","alleditors:Piazza, Mario"],"dc:rights":["info:eu-repo/semantics/openAccess","license:Creative commons","license uri:http://creativecommons.org/licenses/by-sa/4.0/"],"dc:subject":["Settore PHIL-02/A - Logica e filosofia della scienza"],"dc:title":["The Other Option"],"dc:type":["info:eu-repo/semantics/doctoralThesis"]},"updated_at":"2026-07-27T20:19:03Z"}