Brandomâs Account of Defeasible Reasoning: Problems and Solutions
Bibliographic record
Abstract
Robert Brandom has provided what is probably one of the best worked out accounts of how the meanings of linguistic expressions are determined by how they are used—in particular, used in inferences. There are three different types of inferential relations in terms of which Brandom gives his account: commitment-preserving, entitlement-preserving, and incompatibility relations.\n\nBrandom also recognizes that most of the reasoning we engage in is defeasible (or deductively inconclusive). For example, the inference from ‘Tweety is a bird’ to ‘Tweety can fly’ is defeasible, because it can be defeated if there is stronger overriding reason to deny that ‘Tweety can fly’—such as Tweety’s being a penguin. Surprisingly, Brandom’s three types of inferential relations are inadequate for describing defeasible inference. In my dissertation I explain how the problem arises—it’s actually two problems—and I propose a solution that is consistent with Brandom’s overall approach.\n\nThe first problem is that although Brandom's account does explain how someone can lose entitlement to a claim by committing themselves to some other claim, as in the Tweety example, it doesn’t allow subsequent recovery of entitlement to that claim by the addition of yet further information—say, that Tweety is a penguin with a jetpack. Once defeated (by some information), an inference stays defeated, on Brandom's account. The second problem is that of interpretation: when should we interpret someone as committed to the propriety of an inference that is defeasible? Brandom's account of what it is to endorse an inferential relation has no room for the important distinction between endorsing an inference in a context in which it happens to be defeated, and not endorsing it at all.\n\nIn the latter portion of this dissertation I propose various modifications to Brandom’s account that will allow it overcome these problems. I solve the first problem by modifying Brandom’s account of how someone is obliged to update their beliefs in light of the inferential relations they endorse. I solve the second problem by modifying Brandom’s account of when we can appropriately interpret someone as endorsing particular inferential relations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.003 | 0.015 |
| Scholarly communication | 0.007 | 0.020 |
| Open science | 0.003 | 0.006 |
| Research integrity | 0.007 | 0.010 |
| Insufficient payload (model declined to judge) | 0.010 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".