Level two of the quantifier alternation hierarchy over infinite words
© Springer International Publishing Switzerland 2016. The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given language w...
Saved in:
Main Authors: | , |
---|---|
Format: | Default Conference proceeding |
Published: |
2016
|
Subjects: | |
Online Access: | https://hdl.handle.net/2134/31980 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|