Bisimilarity on NLMP is analytic in general, Borel for well-founded cases, and not characterizable by any countable fragment of basic modal logic with denumerable conjunctions.
Friedman , author L
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The complexity of bisimilarity on pointmass processes
Bisimilarity on NLMP is analytic in general, Borel for well-founded cases, and not characterizable by any countable fragment of basic modal logic with denumerable conjunctions.