k-CCWL isomorphism tests are equivalent to TC_{k+2} topological counting logic and topological (k+2)-pebble games, characterizing the logical expressiveness of TNNs.
It is known thatχ (∞) k,A (uA) =χ (∞) k,B (uB), implying the equality in Equation (30)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Logical Expressiveness of Topological Neural Networks
k-CCWL isomorphism tests are equivalent to TC_{k+2} topological counting logic and topological (k+2)-pebble games, characterizing the logical expressiveness of TNNs.