Show simple item record

dc.contributor.authorRayo, Agustin
dc.date.accessioned2011-03-30T16:11:21Z
dc.date.available2011-03-30T16:11:21Z
dc.date.issued2010-05
dc.date.submitted2010-02
dc.identifier.issn0004-8402
dc.identifier.issn1471-6828
dc.identifier.urihttp://hdl.handle.net/1721.1/61997
dc.description.abstractI will argue for localism about credal assignments: the view that credal assignments are only well-defined relative to suitably constrained sets of possibilities. I will motivate the position by suggesting that it is the best way of addressing a puzzle devised by Roger White.en_US
dc.language.isoen_US
dc.publisherRoutledge/Taylor & Francis Groupen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/00048401003746009en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleA Puzzle About Ineffable Propositionsen_US
dc.typeArticleen_US
dc.identifier.citationRayo, Agustin. "A Puzzle About Ineffable Propositions." Australasian Journal of Philosophy, 2010; pp. 1–7en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Linguistics and Philosophyen_US
dc.contributor.approverRayo, Agustin
dc.contributor.mitauthorRayo, Agustin
dc.relation.journalAustralasian Journal of Philosophyen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsRayo, Agustinen
dc.identifier.orcidhttps://orcid.org/0000-0003-1847-2770
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record