Abstract
In [1], we introduced a classification of extensions of Johansson’s minimal logic J by means of slices and proved the decidability of the classification. In this article, we find sufficiently simple necessary conditions for the maximality of logics in the slices formulated in terms of frames. This makes it possible to describe an efficient procedure for computing the slice number of any finitely axiomatizable logic over J. The maximal logics of the upper slices are written down explicitly.
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.
