Abstract
We study two kinds of combined modal logics, semiproducts and products with S5, and their correlation with modal predicate logics. We obtain examples of propositional modal logics when these semiproducts or products are axiomatized in the minimal way (semiproduct- or product-matching with S5), as well as counterexamples for these properties. The fmp for (semi)products together with (semi)product-matching allow us to show decidability of corresponding 1-variable modal predicate 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 callMore From: Доклады Российской академии наук. Математика, информатика, процессы управления
Disclaimer: 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.
