Level Two of the quantifier alternation hierarchy over infinite words

© 2017 Springer Science+Business Media, LLC 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 whether it...

Full description

Bibliographic Details

Main Authors:	Manfred Kufleitner, Tobias Walter
Format:	Default Article
Published:	2017
Subjects:	Distributed computing and systems software not elsewhere classified Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified untagged Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified Distributed Computing
Online Access:	https://hdl.handle.net/2134/31947
Tags:	Add Tag No Tags, Be the first to tag this record!