{"title":"Putting oughts together","authors":"David Boylan","doi":"10.3765/sp.16.5","DOIUrl":null,"url":null,"abstract":"Consistent Agglomeration says that, when φ and ψ are consistent, ⌜ought φ⌝ and ⌜ought ψ⌝ entail ⌜ought (φ ∧ ψ)⌝; I argue this principle is valid for deontic, but not epistemic oughts. I argue no existing theory predicts these data and give a new semantics and pragmatics for ought: ought is an existential quantifier over the best partial answers to some background question; and presupposes that those best partial answers are pairwise consistent. In conjunction with a plausible assumption about the difference between deontic and epistemic orderings, this semantics validates Agglomeration for deontics but not epistemics. EARLY ACCESS","PeriodicalId":45550,"journal":{"name":"Semantics & Pragmatics","volume":null,"pages":null},"PeriodicalIF":1.1000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Semantics & Pragmatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3765/sp.16.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"LANGUAGE & LINGUISTICS","Score":null,"Total":0}
引用次数: 0
Abstract
Consistent Agglomeration says that, when φ and ψ are consistent, ⌜ought φ⌝ and ⌜ought ψ⌝ entail ⌜ought (φ ∧ ψ)⌝; I argue this principle is valid for deontic, but not epistemic oughts. I argue no existing theory predicts these data and give a new semantics and pragmatics for ought: ought is an existential quantifier over the best partial answers to some background question; and presupposes that those best partial answers are pairwise consistent. In conjunction with a plausible assumption about the difference between deontic and epistemic orderings, this semantics validates Agglomeration for deontics but not epistemics. EARLY ACCESS