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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
