<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, I focus on the so-called ‘tacking by disjunction problem.’ Namely, the problem to the effect that, if a hypothesis <italic>h</italic> is confirmed by a statement <italic>e</italic>, <italic>h</italic> is confirmed by the disjunction <italic>e</italic> ∨ <italic>f</italic>, for whatever statement <italic>f</italic>. I show that the attempt to settle this difficulty made by Grimes 1990, in a paper apparently forgotten by today methodologists, is irremediably faulty.</p></abstract>

In this paper, I focus on the so-called ‘tacking by disjunction problem.’ Namely, the problem to the effect that, if a hypothesis h is confirmed by a statement e, h is confirmed by the disjunction e ∨ f, for whatever statement f. I show that the attempt to settle this difficulty made by Grimes 1990, in a paper apparently forgotten by today methodologists, is irremediably faulty.

Grimes on the tacking by disjunction problem

Disputatio

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Grimes on the tacking by disjunction problem"}

In this paper, I focus on the so-called ‘tacking by disjunction problem.’ Namely, the problem to the effect that, if a hypothesis h is confirmed by a statement...

Grimes on the tacking by disjunction problem

Data publikacji: 31 gru 2018

Zakres stron: 16 - 20

DOI: https://doi.org/10.2478/disp-2004-0008

© 2004 Luca Moretti, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.