Argumentation 28 (3):379-393 (2014)

Marcin Selinger
University of Wroclaw
The aim of this paper is to propose foundations for a formal model of representation and numerical evaluation of a possibly broad class of arguments, including those that occur in natural discourse. Since one of the most characteristic features of everyday argumentation is the occurrence of convergent reasoning, special attention should be paid to the operation ⊕, which allows us to calculate the logical force of convergent arguments with an accuracy not offered by other approaches
Keywords Argument structure  Linked argument  Convergent argument  Circularity  Acceptability  Logical force of argument  Argument evaluation
Categories (categorize this paper)
DOI 10.1007/s10503-014-9325-3
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 68,975
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Defeasible Reasoning.John L. Pollock - 1987 - Cognitive Science 11 (4):481-518.
Elements of Logic.Richard Whately - 1826 - London, England: Scholars' Facsimiles & Reprints.

View all 23 references / Add more references

Citations of this work BETA

View all 8 citations / Add more citations

Similar books and articles


Added to PP index

Total views
27 ( #420,353 of 2,498,162 )

Recent downloads (6 months)
4 ( #171,347 of 2,498,162 )

How can I increase my downloads?


My notes