Padding and the expressive power of existential second-order logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 461-477

  Schwentick, Thomas ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER CIRCUITS; GRAPHIC METHODS; POLYNOMIALS; RECONFIGURABLE HARDWARE; TREES (MATHEMATICS);

COMPUTATIONAL COMPLEXITY THEORY; EXPRESSIVE POWER; ISOLATED VERTICES; LINEAR ORDER; SECOND ORDERS; SECOND-ORDER LOGIC; SUBLOGICS; UNARY FUNCTIONS;

GRAPH THEORY;

EID: 84957700797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028031     Document Type: Conference Paper

References (17)

1. M. Ajtai and R. Fagin. Reachability is harder for directed than for undirected finite graphs. Journal of Symbolic Logic, 55(1):113-150, 1990.
2. Sanjeev Arora and Ronald Fagin. On winning strategies in Ehrenfeucht-Fraisse games. Theoretical Computer Science, 174(l-2):97-121, 1997.
3. M. Ajtai. Ef formulae on finite structures. Ann. of Pure and Applied Logic, 24:1-48, 1983.
4. M. de Rougemont. Second-order and inductive definability on finite structures. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, 33:47-63, 1987.
5. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
6. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43-73, 1974.
7. R. Fagin. Monadic generalized spectra. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, 21:89-96, 1975.
8. E. Grandjean and F. Olive. Monadic logical definability of NP-complete problems. In Proc. 1994 of the Annual Conference of the EACSL, pages 190-204, 1994. Extended version submitted.
9. E. Graedel. On logical descriptions of some concepts in structural complexity classes. In E. Borger, H. Kleine Buning, and M.M. Richter, editors, CSL’89: 3rd Workshop on Computer Science Logic, volume 440 of LNCS, pages 163-175. Springer-Verlag, 1990.
10. E. Grandjean. First-order spectra with one variable. Journal of Computer and System Sciences, 40:136-153, 1990.
11. M. Kreidler and D. Seese. Monadic NP and built-in trees. In Proceedings CSL 96, volume 1258 of LNCS, pages 260-274. Springer-Verlag, 1997. Presented at CSL 96.
12. Bernd Loescher. One unary function says less than two in existential second order logic. Information Processing Letters, 61(2):69-75, 28 January 1997.
13. J. F. Lynch. Complexity classes and theories of finite models. Mathematical System Theory, 15:127-144, 1982.
14. J. F. Lynch. The quantifier structure of sentences that characterize nondeterministic time complexity. Computational Complexity, 2:40-66, 1992.
15. T. Schwentick. Graph connectivity, monadic NP and built-in relations of moderate degree. In Proc. 22nd International Colloq. on Automata, Languages, and Programming, pages 405-416, 1995.
16. T. Schwentick. On bijections vs. unary functions. In Proc. 13th Symposium on Theoretical Aspects of Computer Science STACS 96, pages 415-426, 1996.
17. T. Schwentick. On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic, 79:61-92, 1996.