"Undecidability of satisfiability of expansions of FO[<] over words with ..."

Arthur Milchior (2017)

> Home

Details and statistics

DOI: 10.3233/COM-170069

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computability/Milchior17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computability/Milchior17
Arthur Milchior:
Undecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set. Comput. 6(4): 333-363 (2017)

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.