Graded modalities. I (Q1065786): Difference between revisions

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.

0 references

Mathematics Subject Classification ID

03B45

0 references

0 references

0 references

modal logic

0 references

modal operators

0 references

complete axiomatization

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4196401

0 references

Decidability results in non-classical logics

0 references

Q5625118

0 references

Q5604443

0 references

Q5332215

0 references

Decidability of Second-Order Theories and Automata on Infinite Trees

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1065786

@@ Property / cites work @@
+Q4196401
@@ Property / cites work: Q4196401 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability results in non-classical logics
@@ Property / cites work: Decidability results in non-classical logics / rank @@
+Normal rank
@@ Property / cites work @@
+Q5625118
@@ Property / cites work: Q5625118 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5604443
@@ Property / cites work: Q5604443 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5332215
@@ Property / cites work: Q5332215 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of Second-Order Theories and Automata on Infinite Trees
+Normal rank