Unfortunately the paper contains three minor inaccuracies, none of which zlo u$k,v the main results. \* The result wrongly attributed in the proof of Proposition 2 to Ajtai and Fagin [l], is due to R. Fagin in Monadic generalized spectra, Zeitschrift tiir Mathematische Logik and Grundlagen der Mathe
Arity and alternation in second-order logic
β Scribed by J.A. Makowsky; Y.B. Pnueli
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 844 KB
- Volume
- 78
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The aim of this paper is to point out the equivalence between three notions respectively issued from recursion theory, computational complexity and finite model theory. One the one hand, the rudimentary languages are known to be characterized by the linear hierarchy. On the other hand,
This article is part of a project consisting in expressing, whenever possible, graph properties and graph transformations in monadic second-order logic or in its extensions using modulo p cardinality set predicates or auxiliary linear orders. A circle graph is the intersection graph of a set of chor
Various recent results about monadic second order logic and its fragments are presented. These results have been obtained in the framework of the EU TMR Project GETGRATS.
CHARACTERIZING SECOND ORDER LOGIC WITH FIRST ORDER QU-4NTIFIERX by DAVID HAREL in Cambridge, Massachusets (U.S.A.) l) ') The author is indebted to W. J. WALKOE, A. R. MEYER, A. SHAMIR and a rcfeiee for comments on previous versions.