Skip to main content

Factives and Intensionality

  • Conference paper
New Frontiers in Artificial Intelligence (JSAI-isAI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6797))

Included in the following conference series:

Abstract

Notions of normal intensionality and intensionality preserving negation are introduced. Both these notions apply to intensional sentential operators. When applied to factive operators they allows us to understand the way these operators give rise to presuppositions and their duals, assertions. They allow us also to distinguish semantically emotive factives from non-emotive ones.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Cresswell, M.: Hyperintensional logic. Studia Logica 34, 25–38 (1975)

    Article  MathSciNet  Google Scholar 

  • Egré, P.: Question-Embedding and Factivity. Philosophische Studien 77, 85–125 (2008)

    Article  Google Scholar 

  • Fillmore, C.: Entailments rules in a semantic theory. Project on Linguistic Analysis Report N 10 (1965); reprinted in Rosenberg and Travis (eds.) Readings in the Philosophy of Language. Prentice Hall, Englewood Cliffs (1972)

    Google Scholar 

  • Karttunen, L.: Implicative verbs. Language 47, 340–358 (1971)

    Article  Google Scholar 

  • Kiparsky, P., Kiparsky, C.: Fact. In: Bierwisch, M., Heidolph, K.E. (eds.) Progress in Linguistics, pp. 143–173. Mouton, The Hague (1970)

    Google Scholar 

  • Odegard, D.: On defining ’S knows that p’. Philosophical Quarterly 15 (1965)

    Google Scholar 

  • Partee, B.H.: Semantics - Mathematics or Psychology? In: Bauerle, R., et al. (eds.) Semantics from Different Points of View, pp. 1–14. Springer, Heidelberg (1979)

    Google Scholar 

  • Pelletier, F.J.: The Principle of Semantic Compositionality. Topoi 13, 11–24 (1994)

    Article  MathSciNet  Google Scholar 

  • Sharvit, Y.: Trying to be Progressive: the Extensionality of Try. Journal of Semantics 20, 403–445 (2003)

    Article  Google Scholar 

  • Zuber, R.: Decomposition of factives. Studies in Language 1:4, 407–421 (1977)

    Article  Google Scholar 

  • Zuber, R.: Note on why factives cannot assert what their complement sentences express. Semantikos 4-2 (1980)

    Google Scholar 

  • Zuber, R.: Some universal constraints on the semantic content of complex sentences. In: Dirven, R., Radden, G. (eds.) Issues in the Theory of Universal Grammar, pp. 145–157. Gunter Narr Verlag, Tubingen (1982)

    Google Scholar 

  • Zuber, R.: Semantic restrictions on certain complementizers. In: Proc. of the 12th International Congress of Linguists, Tokyo, pp. 434–436 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zuber, R. (2011). Factives and Intensionality. In: Onada, T., Bekki, D., McCready, E. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2010. Lecture Notes in Computer Science(), vol 6797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25655-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25655-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25654-7

  • Online ISBN: 978-3-642-25655-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics