English

An Acceptance Semantics for Stable Modal Knowledge

Logic in Computer Science 2023-07-12 v1

Abstract

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive theses: the thesis that knowledge ascriptions are always veridical and a `negative transparency' thesis that reduces knowledge of a simple negated `might' claim to an epistemic claim without modal content. We motivate a strategy for answering the trade-off: preserve veridicality and (generalized) negative transparency, while abandoning the general validity of contraposition. We survey and criticize various approaches for incorporating veridicality into domain semantics, a paradigmatic `information-sensitive' framework for capturing negative transparency and, more generally, the non-classical behavior of sentences with epistemic modals. We then present a novel information-sensitive semantics that successfully executes our favored strategy: stable acceptance semantics.

Keywords

Cite

@article{arxiv.2307.05064,
  title  = {An Acceptance Semantics for Stable Modal Knowledge},
  author = {Peter Hawke},
  journal= {arXiv preprint arXiv:2307.05064},
  year   = {2023}
}

Comments

In Proceedings TARK 2023, arXiv:2307.04005

R2 v1 2026-06-28T11:26:47.828Z