You are not logged in |
A probabilistic logic for infinite trees
- Speaker(s)
- Mikołaj Bojańczyk
- Affiliation
- Uniwersytet Warszawski
- Date
- Dec. 2, 2015, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
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.
