REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION

DOI10.1017/bsl.2021.17OpenAlexW3159106070MaRDI QIDQ5009679

Walter Alexandre Carnielli, Cristina Sernadas, João Rasga

Publication date: 5 August 2021

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/bsl.2021.17

zbMATH Keywords

reductiondecidabilitymeet-combination of logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Combined logics (03B62)

Related Items (1)

Conservative translations revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Handbook of computability theory
• Admissibility of logical inference rules
• Synchronization of logics
• Paraconsistent logic: consistency, contradiction and negation
• Analysis and synthesis of logics. How to cut and paste reasoning systems
• General recursive functions of natural numbers
• Fibring: completeness preservation
• Turing Computability
• Polynomial ring calculus for modalities
• Properties of independently axiomatizable bimodal logics
• Axioms for abstract model theory
• On languages with two variables
• On the Decision Problem for Two-Variable First-Order Logic
• Modulated fibring and the collapsing problem
• On meet-combination of logics
• PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS
• The classical decision problem.

This page was built for publication: REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION