IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i19p3481-d923434.html
   My bibliography  Save this article

Decidability Preservation and Complexity Bounds for Combined Logics

Author

Listed:
  • Carlos Caleiro

    (Security and Quantum Information Group—Instituto de Telecomunicações, Department Matemática—Instituto Superior Técnico, Universidade de Lisboa, 1049-001 Lisbon, Portugal
    These authors contributed equally to this work.)

  • Sérgio Marcelino

    (Security and Quantum Information Group—Instituto de Telecomunicações, Department Matemática—Instituto Superior Técnico, Universidade de Lisboa, 1049-001 Lisbon, Portugal
    These authors contributed equally to this work.)

Abstract

Transfer theorems for combined logics provide essential tools and insight for reasoning about complex logical systems. In this paper, we present the first sufficient criterion (contextual extensibility ) for decidability to be preserved through combination of propositional logics, and we study the complexity upper bounds induced by the method. In order to assess the scope and usability of our criterion, we illustrate its use in re-obtaining two standard important (though partial) results of the area: the preservation of decidability for disjoint combinations of logics, and the preservation of decidability for fusions of modal logics. Due to the very abstract nature and generality of the idea underlying contextual extensibility, we further explore its applicability beyond propositional logics. Namely, we explore the particular case of 2-deductive systems, and as a byproduct, we obtain the preservation of decidability for disjoint combinations of equational logics and discuss the relationship of this result and of our criterion with several related results with meaningful applications in satisfiability modulo theories.

Suggested Citation

  • Carlos Caleiro & Sérgio Marcelino, 2022. "Decidability Preservation and Complexity Bounds for Combined Logics," Mathematics, MDPI, vol. 10(19), pages 1-19, September.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3481-:d:923434
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/19/3481/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/19/3481/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3481-:d:923434. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.