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 (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 November 2019

Its Solution

Its Solution

Chapter:
(p.56) 4 Its Solution
Source:
Being For
Author(s):

Mark Schroeder (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199534654.003.0004

This chapter employs the Basic Expressivist Maneuver to show how the negation problem can be solved, by appeal only to A-type inconsistency. To do so, expressivists must give up the idea that normative predicates semantically correspond to primitive attitudes, and allow that all normative sentences express a single attitude, to which different predicates contribute different contents. This attitude is called ‘being for’. Four explanations are offered of the elegance and attractiveness of the resulting account, and it is argued that it is the only way to solve the negation problem by appeal to expressivist-respectable assumptions. A possible objection is addressed.

Keywords:   negation problem, Basic Expressivist Maneuver, being for, A-type inconsistency, normative predicates

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 .