Abstract
AbstractAdmissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics, under mild conditions. A weak form of structural completeness is proved to be preserved by the combination. Decidability of the set of admissible rules is also shown to be preserved, with no penalty on the time complexity. Examples are provided for the meet-combination of intermediate and modal logics.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
