2012
DOI: 10.1007/s10992-012-9228-4
|View full text |Cite
|
Sign up to set email alerts
|

A Counterexample to Modus Tollens

Abstract: This paper defends a counterexample to Modus Tollens, and uses it to draw some conclusions about the logic and semantics of indicative conditionals and probability operators in natural language. Along the way we investigate some of the interactions of these expressions with knows, and we call into question the thesis that all knowledge ascriptions have truthconditions. A probabilistic dynamic semantics for probability operators, conditionals, and acceptance attitudes is developed around the idea of representin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
67
0
1

Year Published

2012
2012
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 80 publications
(72 citation statements)
references
References 35 publications
(95 reference statements)
0
67
0
1
Order By: Relevance
“…This brings us to our fourth desideratum: our theory should explain this surprising difference between simple disjunctions and disjunctions containing epistemic vocabulary. A semantics for 'or' is missing from Yalcin 2007Yalcin , 2011Yalcin , 2012a, and related papers. Hence the relevant challenge for Yalcin is to state a semantics that predicts the behavior just described.…”
Section: :12mentioning
confidence: 99%
“…This brings us to our fourth desideratum: our theory should explain this surprising difference between simple disjunctions and disjunctions containing epistemic vocabulary. A semantics for 'or' is missing from Yalcin 2007Yalcin , 2011Yalcin , 2012a, and related papers. Hence the relevant challenge for Yalcin is to state a semantics that predicts the behavior just described.…”
Section: :12mentioning
confidence: 99%
“…Yalcin (2012) independently reached this conclusion about probably on similar grounds. sensitive expressions by denying the literal and non-elliptical truth of (1b) and (1c).…”
Section: Objection #3: Ellipsismentioning
confidence: 71%
“…The near-orthodox account of conditionals in ordinary language is Kratzer's (1981;1991) restrictor analysis. And as Charlow (2013) and Yalcin (2012) observe, that analysis doesn't validate modus ponens.…”
Section: (6b)mentioning
confidence: 96%
“…We define ϕ := ¬♦¬ϕ. We will discuss a semantics for the modal-indicative language due to Yalcin [2012]. This is a simplified A domain model for the modal-indicative language is simply a set W of worlds together with an assignment of subsets of W to proposition letters.…”
Section: Indicative Conditionalsmentioning
confidence: 99%
“…Concerning the notion of semantic consequence for this language, we now deviate from the standard definition of consequence used in the previous two case studies. Following Yalcin [2012Yalcin [ , p. 1019, we say that a formula ϕ is an informational consequence of a set Γ of formulas iff for every model W and information state i ⊆ W , if i ⊆ γ i ("i accepts γ") for every γ ∈ Γ, then i ⊆ ϕ i ("i accepts ϕ"). An argument from Yalcin 2007 in favor of this definition of consequence for a language with epistemic modals is that it predicts the defectiveness of sentences like "It is raining and it might not be raining", formalized as p ∧ ♦¬p.…”
Section: Indicative Conditionalsmentioning
confidence: 99%