Decidability of the interpolation problem and of related properties in tabular logics

DOI10.1007/S10469-009-9070-0zbMath1241.03032OpenAlexW2075252106MaRDI QIDQ431717

Larisa L. Maksimova

Publication date: 29 June 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-009-9070-0

zbMATH Keywords

decidabilityinterpolation propertyBeth definability propertyHalldén propertytabular logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Interpolation, preservation, definability (03C40) Paraconsistent logics (03B53) Intermediate logics (03B55)

Related Items (4)

Interpolation properties in the extensions of the logic of inequality ⋮ Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ Interpolation in weakly transitive modal logics ⋮ Decidability of the weak interpolation property over the minimal logic

Cites Work

• Undecidable properties of extensions of the logic of provability
• Logical matrices and the amalgamation property
• Interpolation and the Robinson property for logics not closed under the Boolean operations
• Logics without Craig's interpolation property
• Craig's theorem in superintuitionistic logics and amalgamable varieties of pseudo-Boolean algebras
• Modal logics and varieties of modal algebras: The Beth properties, interpolation, and amalgamation
• Intuitionistic logic and implicit definability
• On variable separation in modal and superintuitionistic logics
• An analog of Beth's theorem in normal extensions of the modal logic K4
• Definability and interpolation in non-classical logics
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• Interpolation and Definability in Extensions of the Minimal Logic
• A weak form of interpolation in equational logic
• Splitting lattices of logics
• Algebras Whose Congruence Lattices are Distributive.
• On the semantic non-completeness of certain Lewis calculi
• 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
• Unnamed Item

This page was built for publication: Decidability of the interpolation problem and of related properties in tabular logics