Skip to main content

Intersecting Adjectives in Syllogistic Logic

  • Conference paper
The Mathematics of Language (MOL 2009, MOL 2007)

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

Abstract

The goal of natural logic is to present and study logical systems for reasoning with sentences of (or which are reasonably close to) ordinary language. This paper explores simple systems of natural logic which make use of intersecting adjectives; these are adjectives whose interpretation does not vary with the noun they modify. Our project in this paper is to take one of the simplest syllogistic fragments, that of all and some, and to add intersecting adjectives. There are two ways to do this, depending on whether one allows iteration or prefers a “flat” structure of at most one adjective. We present rules of inference for both types of syntax, and these differ. The main results are four completeness theorems: for each of the two types of syntax we have completeness for the all fragment and for the full language of this paper.

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

  1. Keenan, E.L., Faltz, L.M.: Boolean Semantics for Natural Language. In: Synthese Language Library, vol. 23, D. Reidel Publishing Co., Dordrecht (1985)

    Google Scholar 

  2. Łukasiewicz, J.: Aristotle’s Syllogistic from the Standpoint of Modern Formal Logic. Clarendon Press, Oxford (1951)

    MATH  Google Scholar 

  3. Moss, L.S.: Completeness Theorems for Syllogistic Fragments. In: Logics for Linguistic Structures, vol. 29, pp. 143–173. Mouton de Gruyter, Berlin (2008)

    Chapter  Google Scholar 

  4. Moss, L.S.: Logics for Two Fragments Beyond the Syllogistic Boundary. In: Blass, A., et al. (eds.) Studies in Honor of Yuri Gurevich, August 2009. LNCS. Springer, Heidelberg (2010)

    Google Scholar 

  5. Nishihara, N., Morita, K., Iwata, S.: An Extended Syllogistic System with Verbs and Proper nouns, and its Completeness Proof. Systems and Computers in Japan 21(1), 760–771 (1990)

    MathSciNet  Google Scholar 

  6. Pratt-Hartmann, I., Moss, L.S.: Logics for the Relational Syllogistic. Review of Symbolic Logic 2(4), 647–683 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Westerståhl, D.: Aristotelian Syllogisms and Generalized Quantifiers. Studia Logica XLVIII(4), 577–585 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moss, L.S. (2010). Intersecting Adjectives in Syllogistic Logic. In: Ebert, C., Jäger, G., Michaelis, J. (eds) The Mathematics of Language. MOL MOL 2009 2007. Lecture Notes in Computer Science(), vol 6149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14322-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14322-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14321-2

  • Online ISBN: 978-3-642-14322-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics