IDEAS home Printed from https://ideas.repec.org/a/rfa/journl/v11y2023i3p3237.html
   My bibliography  Save this article

How to Derive the Other 37 Valid Modal Syllogisms from the Syllogism ◇A£I◇I-1

Author

Listed:
  • Long Wei

Abstract

Syllogistic reasoning plays an important role in natural language information processing. In order to provide a consistent interpretation for Aristotelian modal syllogistic, this paper firstly proves the validity of the syllogism ◇A£I◇I-1, and then takes it as the basic axiom to derive the other 37 valid modal syllogisms on the basis of some reasoning rules in classical propositional logic, the transformation between any one of Aristotelian quantifiers and its three negative quantifiers, the symmetry of the Aristotelian quantifier some and no, and some relevant definitions and facts. In other words, there are reducibility between the modal syllogism ◇A£I◇I-1 and the other 37 valid modal syllogisms. There are infinitely many modal syllogism instances in natural language corresponding to every valid modal syllogism, thus this study has important practical significance and theoretical value for natural language information processing in computer science.

Suggested Citation

  • Long Wei, 2023. "How to Derive the Other 37 Valid Modal Syllogisms from the Syllogism â—‡A£Iâ—‡I-1," International Journal of Social Science Studies, Redfame publishing, vol. 11(3), pages 3237-3237, May.
    • Handle: RePEc:rfa:journl:v:11:y:2023:i:3:p:3237
    as

    Download full text from publisher

    File URL: https://redfame.com/journal/index.php/ijsss/article/download/6099/6160
    Download Restriction: no
    File URL: https://redfame.com/journal/index.php/ijsss/article/view/6099
    Download Restriction: no
    ---><---

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:rfa:journl:v:11:y:2023:i:3:p:3237. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Redfame publishing (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.