Skip to main content

Syllogistic Logic with “Most”

  • Conference paper
  • First Online:
Logic, Language, Information, and Computation (WoLLIC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9160))

Abstract

This paper presents a sound and complete proof system for the logical system whose sentences are of the form All X are Y, Some X are Y and Most X are Y, where we interpret these sentences on finite models, with the meaning of “most” being “strictly more than half.” Our proof system is syllogistic; there are no individual variables.

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 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

References

  1. Grädel, E., Otto, M., Rosen, E.: Undecidability results on two-variable logics. Arch. Math. Logic 38(4–5), 313–354 (1999)

    MathSciNet  MATH  Google Scholar 

  2. Lai, T., Endrullis, J., Moss, L.S.: Proportionality graphs. Unpublished ms, Indiana University (2013)

    Google Scholar 

  3. Marnette, B., Kuncak, V., Rinard, M.: Polynomial constraints for sets with cardinality bounds. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 258–273. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Moss, L.S.: Completeness theorems for syllogistic fragments. In: Hamm, F., Kepser, S. (eds.) Logics for Linguistic Structures, pp. 143–173. Mouton de Gruyter, Berlin (2008)

    Google Scholar 

  5. Pratt-Hartmann, I.: No syllogisms for the numerical syllogistic. In: Grumberg, O., Kaminski, M., Katz, S., Wintner, S. (eds.) Languages: From Formal to Natural. LNCS, vol. 5533, pp. 192–203. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Pratt-Hartmann, I., Moss, L.S.: Logics for the relational syllogistic. Rev. Symb. Logic 2(4), 647–683 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank the many people who have discussed this topic with us, including Elizabeth Kammer, Tri Lai, Ian Pratt-Hartmann, Selçuk Topal, Chloe Urbanski, Erik Wennstrom, and Sam Ziegler.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lawrence S. Moss .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Endrullis, J., Moss, L.S. (2015). Syllogistic Logic with “Most”. In: de Paiva, V., de Queiroz, R., Moss, L., Leivant, D., de Oliveira, A. (eds) Logic, Language, Information, and Computation. WoLLIC 2015. Lecture Notes in Computer Science(), vol 9160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47709-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47709-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47708-3

  • Online ISBN: 978-3-662-47709-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics