• DocumentCode
    598646
  • Title

    First-order axiomatization of rough mereology

  • Author

    Tsai, Hsing-chien

  • Author_Institution
    Department of Philosophy, National Chung-Cheng University, Chiayi, Taiwan
  • fYear
    2012
  • fDate
    11-13 Aug. 2012
  • Firstpage
    471
  • Lastpage
    474
  • Abstract
    In this paper, I will look into a possible first-order axiomatization of rough mereology and then show that if the domain is finite, such an axiomatization is in fact equivalent to a theory which is axiomatizable by some mereological axioms that can be found in the literature. From such a result it can be seen that any model of the theory considered forms a finite Boolean algebra. Besides, based on the same result, I will also make some observations about the conditions on a rough inclusion function which can be used to define rough mereology.
  • Keywords
    Boolean algebra; mereology; rough inclusion; rough mereology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Granular Computing (GrC), 2012 IEEE International Conference on
  • Conference_Location
    Hangzhou, China
  • Print_ISBN
    978-1-4673-2310-9
  • Type

    conf

  • DOI
    10.1109/GrC.2012.6468604
  • Filename
    6468604
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=598646