Abstract

Standard accounts of semantics for counterfactuals confront the true–true problem: when the antecedent and consequent of a counterfactual are both actually true, the counterfactual is automatically true. This problem presents a challenge to safety-based accounts of knowledge. In this paper, drawing on work by Angelika Kratzer, Alan Penczek, and Duncan Pritchard, we propose a revised understanding of semantics for counterfactuals utilizing machinery from generalized quantifier theory which enables safety theorists to meet the challenge of the true–true problem