Against the "Ordinary Summing" Test for Convergence

Authors

  • G.C. Goddu University of Richmond

DOI:

https://doi.org/10.22329/il.v23i3.2172

Keywords:

linked, convergent, ordinary sum, conditional probability

Abstract

One popular test for distinguishing linked and convergent argument structures is Robert Yanal's Ordinary Summing Test. Douglas Walton, in his comprehensive survey of possible candidates for the linked/convergent distinction, advocates a particular version of Yanal's test. In a recent article, Alexander Tyaglo proposes to generalize and verifY Yanal's algorithm for convergent arguments, the basis for Yanal's Ordinary Summing Test. In this paper I will argue that Yanal's ordinary summing equation does not demarcate convergence and so his Ordinary Summing Test fails. Hence, despite Walton's recommendation or Tyaglo's generalization, the Ordinary Summing Test should not be used for distinguishing linked argument structures from convergent argument structures.

Downloads

Published

2004-01-01

Issue

Vol. 23 No. 3 (2003)

Section

Articles

License

Copyright for each article published in Informal Logic belongs to its author(s). Informal Logic has the right of first publication. Permission to reprint any article that appears in Informal Logic MUST be obtained in writing from the author(s). In addition to any form of acknowledgement required by the author(s), the following notice must be added to the statement of copyright permission made in the reprint (with the appropriate numbers replacing the ellipses): [Article Title] was originally published in Informal Logic, [year], Volume ..., Number ..., pp. ...-... .