On the Borel Complexity of MSO Definable Sets of Branches

Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak. On the Borel Complexity of MSO Definable Sets of Branches. Fundamenta Informaticae, 98(4):337-349, 2010. [doi]

Authors

Mikolaj Bojanczyk

This author has not been identified. Look up 'Mikolaj Bojanczyk' in Google

Damian Niwinski

This author has not been identified. Look up 'Damian Niwinski' in Google

Alexander Rabinovich

This author has not been identified. Look up 'Alexander Rabinovich' in Google

Adam Radziwonczyk-Syta

This author has not been identified. Look up 'Adam Radziwonczyk-Syta' in Google

Michal Skrzypczak

This author has not been identified. Look up 'Michal Skrzypczak' in Google