2022
DOI: 10.1007/978-3-031-15298-6_13
|View full text |Cite
|
Sign up to set email alerts
|

The Alternation Hierarchy of the $$\mu $$-calculus over Weakly Transitive Frames

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 28 publications
0
0
0
Order By: Relevance
“…This raises the question of whether it is possible to define simulability in anything short of the full µ-calculus. As an upper bound, it is known that the topological µ-calculus collapses to its alternation-free fragment [20], but this fragment is substantially more complex from a syntactic perspective than the tangled fragments. Can something similar be obtained in the general topological setting?…”
Section: Expressive Completeness Of Tangled Fragmentsmentioning
confidence: 99%
“…This raises the question of whether it is possible to define simulability in anything short of the full µ-calculus. As an upper bound, it is known that the topological µ-calculus collapses to its alternation-free fragment [20], but this fragment is substantially more complex from a syntactic perspective than the tangled fragments. Can something similar be obtained in the general topological setting?…”
Section: Expressive Completeness Of Tangled Fragmentsmentioning
confidence: 99%