Nie jesteś zalogowany |
A probabilistic logic for infinite trees
- Prelegent(ci)
- Mikołaj Bojańczyk
- Afiliacja
- Uniwersytet Warszawski
- Termin
- 2 grudnia 2015 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
Consider the following quantifier for infinite trees: “the set of paths π which make φ(π) true has zero probability”.
We consider weak MSO over infinite trees extended with this quantifier.
I would like to report on work in progress, together with Henryk Michalewski and Matteo Mio, where we study the satisfiability problem for this logic. Currently, we believe the problem is decidable.
We consider weak MSO over infinite trees extended with this quantifier.
I would like to report on work in progress, together with Henryk Michalewski and Matteo Mio, where we study the satisfiability problem for this logic. Currently, we believe the problem is decidable.
