Against the "Ordinary Summing" Test for Convergence
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 artic...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Windsor
2004-01-01
|
| Series: | Informal Logic |
| Subjects: | |
| Online Access: | https://informallogic.ca/index.php/informal_logic/article/view/2172 |
| Summary: | 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. |
|---|---|
| ISSN: | 0824-2577 2293-734X |