Asset Details
Do you wish to reserve the book?
SUBJECT-MATTER AND INTENSIONAL OPERATORS III: STATE-SENSITIVE SUBJECT-MATTER AND TOPIC SUFFICIENCY
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
SUBJECT-MATTER AND INTENSIONAL OPERATORS III: STATE-SENSITIVE SUBJECT-MATTER AND TOPIC SUFFICIENCY
Do you wish to request the book?
SUBJECT-MATTER AND INTENSIONAL OPERATORS III: STATE-SENSITIVE SUBJECT-MATTER AND TOPIC SUFFICIENCY
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
SUBJECT-MATTER AND INTENSIONAL OPERATORS III: STATE-SENSITIVE SUBJECT-MATTER AND TOPIC SUFFICIENCY
2024
Overview
Logical frameworks that are sensitive to features of sentences’ subject-matter—like Berto’s topic-sensitive intentional modals (TSIMs)—demand a maximally faithful model of the topics of sentences. This is an especially difficult task in the case in which topics are assigned to intensional formulae. In two previous papers, a framework was developed whose model of intensional subject-matter could accommodate a wider range of intuitions about particular intensional conditionals. Although resolving a number of counterintuitive features, the work made an implicit assumption that the subject-matter of an intensional conditional is a function of the subject-matters of its subformulae. This assumption—which I will call a principle of topic sufficiency—runs counter to some natural intuitions concerning topic. In this paper, we will investigate topic sufficiency and offer a semantic account that is state-sensitive, providing an implementation through the introduction of topic-sensitive logics related to William Parry’s prototypical
$\\mathsf {PAI}$
.
Publisher
Cambridge University Press
Subject
