Abstract
In this paper we prove the finite model property and decidability of a family of modal logics. A binary relation is said to be pretransitive if for some , where is the transitive reflexive closure of . By the height of a frame we mean the height of the preorder . We construct special partitions (filtrations) of pretransitive frames of finite height, which implies the finite model property and decidability of their modal logics.
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.
