MétaCan
Menu
Retour à la cohorte
Enregistrement W2059759980 · doi:10.1353/par.0.0000

On Common Knowledge and <i>Ad Populum</i>: Acceptance as Grounds for Acceptability

2008· article· en· W2059759980 sur OpenAlexaff
David Godden

Notice bibliographique

RevuePhilosophy and Rhetoric · 2008
Typearticle
Langueen
DomaineComputer Science
ThématiqueMulti-Agent Systems and Negotiation
Établissements canadiensUniversity of Windsor
Organismes subventionnairesnon disponible
Mots-clésArgumentation theoryArgument (complex analysis)Rhetorical questionNothingEpistemologyPersuasionContext (archaeology)DialogicSet (abstract data type)Computer sciencePsychologyPhilosophySocial psychologyLinguistics

Résumé

récupéré en direct d'OpenAlex

On Common Knowledge and Ad Populum:Acceptance as Grounds for Acceptability David M. Godden Starting points for argumentation All reasoning, including the reasoning used in argument, has to start from somewhere. Although it may be possible, in principle, to offer support for every claim, in any particular case this strategy cannot be used without hopeless regress. Thus, not every claim used in reasoning can owe its acceptability to some set of reasons offered in its support. Instead, in the context of any given argument or piece of reasoning, some claims must be accepted—if only as starting places—on some other basis. These claims can be called the basic premises of an argument.1 Dialogic approaches to argumentation typically take as the starting place of argumentation the discussants' shared commitments. Alternately, rhetorical approaches standardly take as the starting place of argumentation the audience's existing commitment set or, more broadly, whatever an audience is willing to accept. With each approach the idea seems to be that the effectiveness of persuasion depends on the commitment of the audience to the starting points of argumentation. In a dialogic context, if there are no points of agreement between a proponent and opponent, there is nothing for arguers to "take hold of " when designing and deploying their arguments and no space in which argumentation can take place. In reasoning more generally, if no claims are initially admitted, there is nothing from [End Page 101] which inferences can be drawn, for inference can only generate claims on the basis of other claims. Further, there may even be nothing with which to draw inferences, for if no inferential rules are initially accepted, there will be no inferential moves that can be made even given some initial data set. In these approaches the fact of acceptance (or agreement) seems to give a prima facie acceptability to a set of claims (which I will call an initial commitment set) used as a starting place for argumentation. As a starting place for argumentation, an initial commitment set can include both good and bad information. More generally, we tend to hold that most of our commitments are fallible—they are subject to defeat as refuting evidence comes to light. As such, some claims in an initial commitment set might be unacceptable according to any relevant standard of acceptance. The hope is that the projects of inquiry, argumentation, critical examination, and rational assessment will help sort things out by weeding out the bad claims in the initial commitment set. So, that some claim is accepted by an arguer is a reason for it to be a starting place in argumentation, although it is not on its own a reason (even a prima facie reason) for its acceptability. Rather, the acceptability of a claim is determined by how well it survives the process of argumentation, not where it stands at the beginning. In this article I explore the role acceptance can play in establishing the acceptability of a claim by examining the relationship between appeals to common knowledge and appeals to popular opinion. Typically, that a claim is common knowledge is taken as grounds for its acceptability, whereas appeals to popular opinion are seen as fallacious attempts to support a claim. Against this I argue that appeals to common knowledge generally provide no better evidence for a claim than appeals to popular opinion and, as such, that appeals to common knowledge ought to be just as successful—or unsuccessful—as appeals ad populum. I begin by describing a standard account of appeals to common knowledge and popular opinion that should be familiar to anyone who has taught or studied reasoning skills. I proceed to set out an alternative to this standard view (largely due to Douglas Walton) on which some appeals to popularity can provide defeasible yet presumptive support to a claim sufficient to shift a burden of proof on the balance of considerations. In general, I hold that the standard account is correct and that where ad populum appeals succeed in providing good reasons, they do so because they have been reconstructed as having another argument form that introduces independent reasons for accepting the conclusion. Each of these accounts helps to...

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction machine sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.

score de la tête « metaresearch » (Codex)0,017
score de la tête « metaresearch » (Gemma)0,031
Version: metacan-v3-hybrid-931329e0061cStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Théorique ou conceptuel · Signal consensuel: Théorique ou conceptuel
GenreSignal candidat: Empirique · Signal consensuel: aucune
Score de désaccord entre enseignants0,017
Score d'incertitude au seuil0,090

Scores du classifieur distillé par catégorie (deux têtes)

CatégorieCodexGemma
Métarecherche0,0170,031
Méta-épidémiologie (sens strict)0,0010,001
Méta-épidémiologie (sens large)0,0020,001
Bibliométrie0,0020,003
Études des sciences et des technologies0,0090,060
Communication savante0,0170,027
Science ouverte0,0030,008
Intégrité de la recherche0,0120,015
Charge utile insuffisante (le modèle a refusé de juger)0,0120,003

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,039
Tête enseignante GPT0,280
Écart entre enseignants0,241 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.

Les modèles n’ont appliqué aucune catégorie : rien dans la taxonomie ne correspondait à ce travail.
Devis d'étudeThéorique ou conceptuel
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations26
Publié2008
Routes d'admission1
Résumé présentoui

Explorer davantage

Même revuePhilosophy and RhetoricMême sujetMulti-Agent Systems and NegotiationTravaux en français237 207