The authors introduce a propositional modal language containing the modal operators \(M_ n\), which are, in the usual Kripke semantics, interpreted as there are more than n accessible worlds, such that.... A sound and complete axiomatization is provided, which is also shown to be decidable.
Recommendations
Cites work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decidability results in non-classical logics
- scientific article; zbMATH DE number 3635994 (Why is no real title available?)
- scientific article; zbMATH DE number 3206304 (Why is no real title available?)
- scientific article; zbMATH DE number 3325547 (Why is no real title available?)
- scientific article; zbMATH DE number 3349770 (Why is no real title available?)
Cited in
(35)- Graded modalities. II. (Canonical models)
- Normal predicative logics with graded modalities
- Graded modalities. III: The completeness and compactness of \(S4^ 0\)
- Decidability by filtrations for graded normal logics. (Graded modalities. V)
- Typology of axioms for a weighted modal logic
- Models of nondeterministic regular expressions
- Model theoretical aspects of weakly aggregative modal logic
- Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
- Complexity of modal logics with Presburger constraints
- Logics of belief over weighted structures
- Logic programming with graded modality
- Linear-time temporal logics with Presburger constraints: an overview
- scientific article; zbMATH DE number 487145 (Why is no real title available?)
- Comparative study of variable precision rough set model and graded rough set model
- Some considerations on the logics PFD A logic combining modality and probability
- scientific article; zbMATH DE number 1764657 (Why is no real title available?)
- The Modality of Finite (Graded Modalities VII)
- Do We Need Mathematical Facts?
- Modal operators for rational grading
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
- Introducing polymodal neighbourhood logics
- Finite-Chain Graded Modal Logic
- DYNAMIC GRADED EPISTEMIC LOGIC
- Adequacy of the logic \(\mathrm{K}(\mathsf{E}_{n})\)
- On Composing Finite Forests with Modal Logics
- Completeness and decidability results for some propositional modal logics containing ``actually operators
- COUNTING TO INFINITY: GRADED MODAL LOGIC WITH AN INFINITY DIAMOND
- Modal logics and local quantifiers: a zoo in the elementary hierarchy
- A study of modal logic with semantics based on rough set theory
- Granularity and rational approximation: rethinking graded rough sets
- On the logical and algebraic aspects of reasoning with formal contexts
- An essay in combinatory dynamic logic
- On the undecidability of logics with converse, nominals, recursion and counting
- General canonical models for graded normal logics. (Graded modalities. IV)
This page was built for publication: Graded modalities. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065786)
