0-1 laws and decision problems for fragments of second-order logic
Kolaitis, P.G.; Vardi, M.Y.
Logic in Computer Science, 1988. LICS apos;88., Proceedings of the Third Annual Symposium on
Volume , Issue , 5-8 Jul 1988 Page(s):2 - 11
Digital Object Identifier   10.1109/LICS.1988.5095
Summary:Fragments of existential second-order logic are investigated in which the patterns of first order quantifiers are restricted. The focus is on the class Σ₁¹ (Ackermann) of existential second-order sentences in which the first-order part belongs to the Ackermann class, i.e. it contains at most one universal first-order quantifier. All properties expressible by Σ₁¹ (Ackermann) sentences are NP-computable, and there are natural NP-complete properties, such as satisfiability, that are expressible by such sentences. It is established that the 0-1 law holds for the class Σ₁¹ (Ackermann), and it is shown that the associated decision problem is NEXPTIME-complete. It is also shown that the 0-1 law fails for other fragments of existential second-order logic in which first-order part belongs to certain prefix classes with an unsolvable decision problem

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.