Jump to ContentJump to Main Navigation
Being ForEvaluating the Semantic Program of Expressivism$
Users without a subscription are not able to see the full content.

Mark Schroeder

Print publication date: 2008

Print ISBN-13: 9780199534654

Published to Oxford Scholarship Online: September 2008

DOI: 10.1093/acprof:oso/9780199534654.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 26 January 2021

An Alternative Approach

An Alternative Approach

(p.131) 10 An Alternative Approach
Being For

Mark Schroeder (Contributor Webpage)

Oxford University Press

This chapter offers an alternative approach to assigning truth conditions to complex descriptive sentences. Truth conditions are first motivated as a kind of composite of the assertability conditions on sentences and mistake conditions on mental states. It is then suggested that given biforcated attitude semantics, plausible assumptions about what mistake conditions will involve can be used to assign the right truth conditions to complex descriptive sentences — a result which is proven in an appendix to the chapter. It is further suggested that given an appropriate semantics for ‘believes that’, the expressivist can go on to maintain that the states expressed by complex descriptive sentences really are beliefs, after all.

Keywords:   truth conditions, complex descriptive sentences, assertability conditions, mistake conditions, belief

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .