Decidability of order-based modal logics

DOI10.1016/j.jcss.2017.03.012zbMath1423.03056OpenAlexW2604254479MaRDI QIDQ2361346

George Metcalfe, Jonas Rogger, Xavier Caicedo, Ricardo Oscar Rodríguez

Publication date: 30 June 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/102027/1/CMRR_JCSS2016.pdf

zbMATH Keywords

complexitydecidabilityfinite model propertymany-valued logicsmodal logicsGödel logicsone-variable fragments

Mathematics Subject Classification ID

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

Related Items (12)

UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS ⋮ One-variable fragments of intermediate logics over linear frames ⋮ Frame definability in finitely valued modal logics ⋮ Time and Gödel: fuzzy temporal reasoning in PSPACE ⋮ From Kripke to Neighborhood Semantics for Modal Fuzzy Logics ⋮ A Lindström theorem in many-valued modal logic over a finite MTL-chain ⋮ Expressivity in chain-based modal logics ⋮ On transitive modal many-valued logics ⋮ Completeness for monadic fuzzy logics via functional algebras ⋮ Neighborhood semantics for modal many-valued logics ⋮ Unnamed Item ⋮ Toward a general frame semantics for modal many-valued logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spatial reasoning in a fuzzy region connection calculus
• Fuzzy description logics under Gödel semantics
• Standard Gödel modal logics
• Continuous Fraïssé conjecture
• Metamathematics of fuzzy logic
• On very true
• Superintuitionistic companions of classical modal logics
• Extending maps to profinite completions in finitely generated quasivarieties
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
• First-order Gödel logics
• Making fuzzy description logic more general
• Relationships between nondeterministic and deterministic tape complexities
• A Finite Model Property for Gödel Modal Logics
• Towards a Proof Theory of G\"odel Modal Logics
• On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice
• A propositional calculus with denumerable matrix
• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
• MANY-VALUED MODAL LOGICS: A SIMPLE APPROACH
• On languages with two variables
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Bi-modal Godel logic over [0,1-valued Kripke frames]
• MIPC as the formalisation of an intuitionist concept of modality

This page was built for publication: Decidability of order-based modal logics