Uniform Lyndon interpolation property in propositional modal logics
From MaRDI portal
Publication:781510
DOI10.1007/s00153-020-00713-yzbMath1462.03013arXiv1809.00943OpenAlexW3003029079WikidataQ126313519 ScholiaQ126313519MaRDI QIDQ781510
Publication date: 17 July 2020
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.00943
Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items
Uniform Lyndon interpolation for basic non-normal modal logics ⋮ Uniform interpolation via nested sequents
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
- The Lyndon property and uniform interpolation over the Grzegorczyk logic
- An interpolation theorem in the predicate calculus
- Modal tableau calculi and interpolation
- Uniform interpolation and propositional quantifiers in modal logics
- Proof methods for modal and intuitionistic logics
- Amalgamation and interpolation in normal modal logics
- An algebraic theory of normal forms
- Uniform interpolation and sequent calculi in modal logic
- Undefinability of propositional quantifiers in the modal system S4
- Definability and interpolation in non-classical logics
- Interpolation properties for provability logics GL and GLP
- Proving Craig and Lyndon Interpolation Using Labelled Sequent Calculi
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- The extensions of the modal logic K5
- Transitivity follows from Dummett's axiom
- On systems of modal logic with provability interpretations
- On an interpretation of second order quantification in first order intuitionistic propositional logic
- Arithmetical necessity, provability and intuitionistic logic
