Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

The Counting Problem of Slot Mereology

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • معلومة اضافية
    • Contributors:
      MEthodes et ingénierie des Langues, des Ontologies et du DIscours (IRIT-MELODI); Institut de recherche en informatique de Toulouse (IRIT); Université Toulouse Capitole (UT Capitole); Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J); Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3); Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP); Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI); Université Toulouse - Jean Jaurès (UT2J); Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3); Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole); Université de Toulouse (UT); Université de Sherbrooke (UdeS); Istituto di Scienze e Tecnologie della Cognizione Trento (ISTC-CNR)
    • بيانات النشر:
      HAL CCSD
      ceur-ws.org
    • الموضوع:
      2021
    • Collection:
      Université Toulouse III - Paul Sabatier: HAL-UPS
    • الموضوع:
    • نبذة مختصرة :
      International audience ; Bennett proposed in 2013 a new mereological theory based on the decomposition of the parthood relation into two relations: having a slot and occupying that slot. Slot mereology can be used to represent the mereological structure of a variety of entities that can have the same part multiple times, including (but not only) structural universals. We show here that this theory is not compatible with a counting criterion that would enable us to count appropriately how many times a whole has a part. We propose news axioms to fix those flaws.
    • Relation:
      hal-03486458; https://hal.science/hal-03486458; https://hal.science/hal-03486458/document; https://hal.science/hal-03486458/file/paper49-FOUST.pdf
    • Rights:
      http://creativecommons.org/licenses/by/ ; info:eu-repo/semantics/OpenAccess
    • الرقم المعرف:
      edsbas.663DD21A