"On the Borel Complexity of MSO Definable Sets of Branches."

Mikolaj Bojanczyk et al. (2010)

> Home

Details and statistics

DOI: 10.3233/FI-2010-231

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/BojanczykNRRS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/BojanczykNRRS10
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak:
On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Informaticae 98(4): 337-349 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.