Existential Graded Modal Logic

• Existential graded modal logic is a fragment of modal logic that enhances classical modal operators with explicit cardinality constraints, enabling precise counting of accessible worlds.
• EGML bridges basic and full graded modal logics, with its satisfiability complexity ranging from PSPACE-complete to NEXPTIME-complete depending on frame conditions.
• EGML underpins model-theoretic preservation theorems and parallels the expressiveness of graph neural networks through tree unravelling and homomorphism-count characterizations.

Existential graded modal logic (EGML) is a fragment of modal logic that augments the classical modal operators with explicit cardinality constraints, enabling the expression of statements about the number of accessible worlds that satisfy certain properties. EGML is situated between basic modal logic and full graded modal logic in expressiveness and plays a fundamental role in modal preservation theorems, complexity analysis, and connections to combinatorial invariants and machine learning architectures.

1. Formal Syntax and Semantics

The syntax of existential graded modal logic is based on a countable set of propositional atoms $P = \{p_1, \ldots, p_n\}$ and a single binary relation symbol $R$. The formulas are generated by the grammar: $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$ where $p \in P$, $k \geq 1$, and $\neg p$ is treated as a positive literal (negation is only allowed in front of atoms, not arbitrary subformulas).

• $\Diamond^{\geq k} \varphi$ asserts "there exist at least $k$ $R$-successors satisfying $\varphi$".
• The dual operator $R$0 is defined as $R$1 and asserts "at most $R$2 $R$3-successors satisfy $R$4".

The semantics is given in terms of Kripke structures $R$5, where $R$6 is a nonempty set of worlds, $R$7 is the accessibility relation, and $R$8 assigns truth values to atoms. For a pointed model $R$9:

• $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$0 iff $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$1
• $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$2 iff $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$3
• $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$4 iff $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$5 and $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$6
• $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$7 iff $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$8 or $$\varphi ::= p \quad|\quad \neg p \quad|\quad \varphi \land \varphi \quad|\quad \varphi \lor \varphi \quad|\quad \Diamond^{\geq k}\varphi$$9
• $p \in P$0 iff there exist at least $p \in P$1 distinct $p \in P$2 with $p \in P$3 and $p \in P$4
• $p \in P$5 iff at most $p \in P$6 many $p \in P$7-successors $p \in P$8 of $p \in P$9 satisfy $k \geq 1$0 (0905.3108, Wałęga et al., 2 Feb 2026).

2. Relationship to Ordinary and Graded Modal Logics

Ordinary modal logic can be embedded into EGML by observing that:

• The basic possibility operator $k \geq 1$1 abbreviates $k \geq 1$2.
• The necessity operator $k \geq 1$3 abbreviates $k \geq 1$4.

The expressive gap arises because EGML can directly state properties such as "at least $k \geq 1$5 accessible successors satisfy $k \geq 1$6," going beyond the mere existence assertions of standard modal logic. EGML is strictly less expressive than full graded modal logic (which allows unrestricted negation and counting both "at least" and "at most"), but contains formulas like "there exist at least $k \geq 1$7 successors satisfying $k \geq 1$8" that are not definable in the existential positive fragment of basic modal logic (Wałęga et al., 2 Feb 2026).

3. Complexity of Satisfiability

The complexity of the satisfiability problem for EGML is tightly linked to underlying frame properties:

Frame-class conditions	GradeSat($k \geq 1$9) Complexity
None/only reflexive, serial, symmetric	PSPACE-complete
Euclidean or (symmetric ∧ transitive)	NP-complete
Transitive but not symmetric or Euclidean	NEXPTIME-complete

• If transitivity and Euclideanness are absent, the tree-model property holds, and satisfiability is PSPACE-complete, generalizing Ladner’s result for basic modal logic.
• When Euclidean properties or both symmetry and transitivity are assumed, satisfiability is NP-complete because models can be collapsed to small cone models.
• With (pure) transitive frames lacking symmetry/Euclideanness, EGML fails to have the tree-model property, necessitating exponentially large models and resulting in NEXPTIME-completeness. This reflects the complexity jump directly tied to the failure of usual tableau methods and the need for non-tree-like models (0905.3108).

4. Preservation Theorems and Tree Unravelling

A central model-theoretic result for EGML is its tight connection to embedding invariance and fragmentation by tree-unravelling. For modal depth $\neg p$0:

• Any class of finite pointed models $\neg p$1 invariant under $\neg p$2-unravelling and preserved under embeddings is definable by some existential graded formula of depth $\neg p$3.
• Conversely, every EGML formula of depth $\neg p$4 is both $\neg p$5-unravelling invariant and embedding-preserved.

The mechanism is as follows: each finite unravelling of height $\neg p$6 can be characterized up to isomorphism by a particular EGML formula ("minimal tree" argument), and every such class corresponds to a finite disjunction of these characteristic formulas. Well-quasi-ordering under embedding on bounded-height trees ensures this characterization is finite. The bounded-height condition is essential; without it, infinite antichains prevent such normal forms (Wałęga et al., 2 Feb 2026).

5. Characterization via Homomorphism-Counting

EGML admits a robust Lovász-style model-theoretic invariance characterization:

• For pointed LTSs $\neg p$7 and $\neg p$8, the following are equivalent:
  1. They are indistinguishable by homomorphism counts from all finite rooted trees (with counts in the natural numbers semiring).
  2. Their tree-unravellings are isomorphic.
  3. They satisfy the same graded modal formulas.

Formally, for the class $\neg p$9 of all finite $\Diamond^{\geq k} \varphi$0-trees, $\Diamond^{\geq k} \varphi$1 and $\Diamond^{\geq k} \varphi$2 satisfy the same graded modal formulas iff $\Diamond^{\geq k} \varphi$3. This generalizes the classical Lovász theorem from first-order logic to graded modal logic. The proof leverages the correspondence between modal formula satisfaction and positive existential conjunctive queries, and the tree-unravelling invariance of graded modal logic (Comer, 2024).

6. Extensions, Limitations, and Applications

Extensions:

• EGML can be relativized with additional modalities such as backward (predecessor) or global counting. These extensions are handled by encoding the relevant access relations or global quantifiers into the signature and reducing again to tree-count characterizations.
• The expressive power of EGML also provides a precise logical correspondence to classes of graph neural networks (GNNs): node-classification functions of monotonic, aggregation-based GNNs are exactly as expressive as EGML formulas of matching modal depth (Wałęga et al., 2 Feb 2026).

Limitations:

• Homomorphism-count characterizations do not extend to the full basic modal logic (bisimulation equivalence), due to the presence of ultimately periodic counting behavior in non-injective semirings and the inability to distinguish certain infinite families of graphs (e.g., complete graphs) using hom-counts alone (Comer, 2024).

Applications:

• EGML is a key instrument in preservation theorems: a property or class is preserved under embeddings and bounded unravelling if and only if it is definable in EGML.
• In descriptive complexity and GNN theory, EGML formulas act as tight logical bounds for the expressive power of neural architectures and other logics invariant under embeddings (Wałęga et al., 2 Feb 2026).

7. Illustrative Example

Consider the formula $\Diamond^{\geq k} \varphi$4, expressing "there are at least two $\Diamond^{\geq k} \varphi$5-successors". In a Kripke model $\Diamond^{\geq k} \varphi$6 with $\Diamond^{\geq k} \varphi$7 and $\Diamond^{\geq k} \varphi$8, $\Diamond^{\geq k} \varphi$9 holds. The simplest tree test object $k$0 of depth $k$1 with two children corresponds to this configuration, and $k$2 since there are $k$3 ways to map the children to $k$4 and $k$5 (Comer, 2024).

---

Key References:

• "A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics" (0905.3108)
• "Preservation Theorems for Unravelling-Invariant Classes: A Uniform Approach for Modal Logics and Graph Neural Networks" (Wałęga et al., 2 Feb 2026)
• "Lovász Theorems for Modal Languages" (Comer, 2024)