Frame definability in finitely valued modal logics
From MaRDI portal
Publication:6040618
DOI10.1016/j.apal.2023.103273arXiv2206.12953OpenAlexW4366824924MaRDI QIDQ6040618
Carles Noguera, Guillermo Badia, Xavier Caicedo
Publication date: 19 May 2023
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.12953
Fuzzy logic; logic of vagueness (03B52) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Other algebras related to logic (03G25) Many-valued logic (03B50)
Cites Work
- Modal definability based on Łukasiewicz validity relations
- On fuzzy modal logics \(S5(\mathcal C)\)
- Notes on modal definability
- Possible worlds and many truth values
- The Fregean axiom and Polish mathematical logic in the \(1920^s\)
- Metamathematics of fuzzy logic
- Expressivity in chain-based modal logics
- Lattices and ordered algebraic structures
- First-order modal logic: frame definability and a Lindström theorem
- Varieties of commutative integral bounded residuated lattices admitting a Boolean retraction term
- Meaning-preserving translations of non-classical logics into classical logic: between pluralism and monism
- Extending maps to profinite completions in finitely generated quasivarieties
- Regular elements and Kolmogorov translation in residuated lattices
- Toward a general frame semantics for modal many-valued logics
- Decidability of order-based modal logics
- Varieties of complex algebras
- On modal extensions of Product fuzzy logic
- On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Glivenko like theorems in natural expansions of BCK-logic
- Bi-modal Godel logic over [0,1-valued Kripke frames]
- Some Modal Logics based on a Three‐valued Logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
