"The MSO+U Theory of (N, <) Is Undecidable."

Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk (2016)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2016.21

access: open

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/BojanczykPT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BojanczykPT16
Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U Theory of (N, <) Is Undecidable. STACS 2016: 21:1-21:8

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.