Fibring: Completeness preservation
When we apply the technique of fibring for combining two logics we produce a logic allowing the free mixing the connectives from both logics and using the inference rules from both logics [see \textit{D. M. Gabbay}, Fibring logics, Clarendon Press, Oxford (1999; Zbl 0909.03001)]. In the general case, soundness is shown to be preserved by fibring, but the preservation of completeness remains an open problem. In this paper the authors concentrate their attention on the problem of completeness preservation and give a positive answer to this question with reasonable requirements on the two given logics with `full'\ semantics and availability of `equivalence\'. Namely, since `equivalence'\ implies `congruence'\ and the former is preserved by fibring, the preservation of strong completeness is a consequence of the completeness theorem for general semantics. NEWLINENEWLINENEWLINEAfter a brief review of Hilbert type systems and their fibrings, a general notion of interpretation systems and their fibrings are introduced in order to establish the appropriate notion of general logic system enabling to study the completeness problem. Two examples from modal logic are presented. A strong completeness theorem for logics with full general semantics and with congruence is obtained by using an adapted Henkin construction. Finally, the notion of logic with equivalence is introduced and it is shown that this class of logics is closed under fibring and is a proper subclass of the class of logics with congruence. At both the proof-theoretic and the modal-theoretic level, the authors provide a categorical characterization of fibring.
- A counterexample in tense logic
- Basic logic: reflection, symmetry, visibility
- Fibring of logics as a categorial construction
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 4041866 (Why is no real title available?)
- scientific article; zbMATH DE number 46995 (Why is no real title available?)
- scientific article; zbMATH DE number 1219632 (Why is no real title available?)
- scientific article; zbMATH DE number 755666 (Why is no real title available?)
- Synchronization of logics
- Why combine logics?
- Fibring non-truth-functional logics: Completeness preservation
- On combined connectives
- Fibring as biporting subsumes asymmetric combinations
- Recovering a logic from its fragments by meta-fibring
- Preservation of complete Baireness
- Preservation by fibring of the finite model property
- Splitting logics
- Fusion of sequent modal logic systems labelled with truth values
- On the characterization of fibred logics, with applications to conservativity and finite-valuedness
- Interpolation via translations
- Juxtaposition: a new way to combine logics
- Categorical abstract algebraic logic: meet-combination of logical systems
- Importing logics: soundness and completeness preservation
- Truth-values as labels: a general recipe for labelled deduction
- Combining valuations with society semantics
- Fibring of logics as a categorial construction
- scientific article; zbMATH DE number 1107622 (Why is no real title available?)
- Fibring Logics with Topos Semantics
- Modulated fibring and the collapsing problem
- scientific article; zbMATH DE number 2079666 (Why is no real title available?)
- Fibring Labelled Deduction Systems
- A survey on categories of logics and algebraizable logics
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
- LOGICS OF FORMAL INCONSISTENCY ENRICHED WITH REPLACEMENT: AN ALGEBRAIC AND MODAL ACCOUNT
- Malinowski modalization, modalization through fibring and the Leibniz hierarchy
- Deciding theoremhood in fibered logics without shared connectives
- Fibring in the Leibniz Hierarchy
- Heterogeneous Fibring of Deductive Systems Via Abstract Proof Systems
- Preservation of admissible rules when combining logics
- On categorial combination of logics
- Completeness results for fibred parchments. Beyond the propositional base
- Meet-combination of consequence systems
- An NP-complete fragment of fibring logic
This page was built for publication: Fibring: Completeness preservation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732291)
