Switch to: References

Add citations

You must login to add citations.
  1. E.T. Jaynes’s Solution to the Problem of Countable Additivity.Colin Elliot - 2020 - Erkenntnis 87 (1):287-308.
    Philosophers cannot agree on whether the rule of Countable Additivity should be an axiom of probability. Edwin T. Jaynes attacks the problem in a way which is original to him and passed over in the current debate about the principle: he says the debate only arises because of an erroneous use of mathematical infinity. I argue that this solution fails, but I construct a different argument which, I argue, salvages the spirit of the more general point Jaynes makes. I argue (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Safe Contraction Revisited.Hans Rott & Sven Ove Hansson - 2014 - In Sven Ove Hansson (ed.), David Makinson on Classical Methods for Non-Classical Problems (Outstanding Contributions to Logic, Vol. 3). Springer. pp. 35–70.
    Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of knowledge on safe contraction, provides some new results (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Probability and time.Marco Zaffalon & Enrique Miranda - 2013 - Artificial Intelligence 198 (C):1-51.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Desirability foundations of robust rational decision making.Marco Zaffalon & Enrique Miranda - 2018 - Synthese 198 (Suppl 27):6529-6570.
    Recent work has formally linked the traditional axiomatisation of incomplete preferences à la Anscombe-Aumann with the theory of desirability developed in the context of imprecise probability, by showing in particular that they are the very same theory. The equivalence has been established under the constraint that the set of possible prizes is finite. In this paper, we relax such a constraint, thus de facto creating one of the most general theories of rationality and decision making available today. We provide the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Model theory of measure spaces and probability logic.Rutger Kuyper & Sebastiaan A. Terwijn - 2013 - Review of Symbolic Logic 6 (3):367-393.
    We study the model-theoretic aspects of a probability logic suited for talking about measure spaces. This nonclassical logic has a model theory rather different from that of classical predicate logic. In general, not every satisfiable set of sentences has a countable model, but we show that one can always build a model on the unit interval. Also, the probability logic under consideration is not compact. However, using ultraproducts we can prove a compactness theorem for a certain class of weak models.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Logical Consequence Informed by Probability.Neil F. Hallonquist - 2024 - Logica Universalis 18 (3):395-429.
    There are two general conceptions on the relationship between probability and logic. In the first, these systems are viewed as complementary—having offsetting strengths and weaknesses—and there exists a fusion of the two that creates a reasoning system that improves upon each. In the second, probability is viewed as an instance of logic, given some sufficiently broad formulation of it, and it is this that should inform the development of more general reasoning systems. These two conceptions are in conflict with each (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Compatibility, desirability, and the running intersection property.Enrique Miranda & Marco Zaffalon - 2020 - Artificial Intelligence 283 (C):103274.
    Download  
     
    Export citation  
     
    Bookmark  
  • David Makinson on Classical Methods for Non-Classical Problems.Sven Ove Hansson (ed.) - 2013 - Dordrecht, Netherland: Springer.
    The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources (...)
    Download  
     
    Export citation  
     
    Bookmark