Switch to: References

Add citations

You must login to add citations.
  1. In defense of causal eliminativism.Alice van’T. Hoff - 2022 - Synthese 200 (5):1-22.
    Causal eliminativists maintain that all causal talk is false. The prospects for such a view seem to be stymied by an indispensability argument, charging that any agent must distinguish between effective and ineffective strategies, and that such a distinction must commit that agent to causal notions. However, this argument has been under-explored. The contributions of this paper are twofold: first, I provide a thorough explication of the indispensability argument and the various ways it might be defended. Second, I point to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Deep and shallow conditionals – and three alleged counterexamples.Anna Wójtowicz & Krzysztof Wójtowicz - forthcoming - Inquiry: An Interdisciplinary Journal of Philosophy.
    We analyze three interesting arguments from the literature, where ascribing a probability of 1 to a certain right-nested conditional A→(B→C) leads to strong theses concerning conditionals: they serve as counterexamples to important general claims. The first is the classic and much discussed McGee’s counterexample to Modus Ponens from McGee [“A Counterexample to Modus Ponens.” The Journal of Philosophy 82 (9): 462–471]. The second example was given by Santorio [“Trivializing Informational Consequence.” Philosophy and Phenomenological Research 104:297–320] and is intended to undermine (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Probabilities of Conditionals via Labeled Markov Graphs.Krzysztof Wójtowicz & Anna Wójtowicz - forthcoming - Erkenntnis:1-43.
    In the paper, we provide a general formalism for computing probabilities of indicative conditionals. Our model is based on the idea of constructing a (labeled) Markov graph G(α), which models the sentence α, containing an arbitrarily complex conditional (exhibiting in particular its structure). The formalism makes computing these probabilities an easy task—it consists of solving simple systems of linear equations. The graph G(α) generates a canonical probability space S(α) = (Ωα, Σα, Pα), where α is given an interpretation as an (...)
    Download  
     
    Export citation  
     
    Bookmark