Decidability and complexity of fibred logics without shared connectives

DOI10.1093/JIGPAL/JZW033MaRDI QIDQ4644566zbMATH OpenOpenAlexFDO

Authors Sérgio Marcelino, Carlos Caleiro

Publication date 8 January 2019

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a61b6d2e2befb5c20bd1d57def374da93fe3907e

zbMATH Keywords

complexitydecidability preservationdisjoint fibringfibred logics

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combined logics (03B62)

Recommendations

• Deciding theoremhood in fibered logics without shared connectives
• On Graph-theoretic Fibring of Logics
• On the characterization of fibred logics, with applications to conservativity and finite-valuedness
• An NP-complete fragment of fibring logic
• Coherence and computational complexity of quantifier-free dependence logic formulas
• On decidability of the decomposability problem for finite theories
• Non decomposable connectives of linear logic
• An undecidability result for separation logic with theory reasoning
• scientific article; zbMATH DE number 3871315
• On the complexity of modal separation logics

Cited in

(7)

• Characterizing finite-valuedness
• Proof search on bilateralist judgments over non-deterministic semantics
• On the characterization of fibred logics, with applications to conservativity and finite-valuedness
• Plug and Play Negations
• On Axioms and Rexpansions
• Deciding theoremhood in fibered logics without shared connectives
• An NP-complete fragment of fibring logic

This page was built for publication: Decidability and complexity of fibred logics without shared connectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644566)