Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games

@inproceedings{Marcinkowski1999DirectedRF,
  title={Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fra{\"i}ss{\'e} Games},
  author={J. Marcinkowski},
  booktitle={CSL},
  year={1999}
}
  • J. Marcinkowski
  • Published in CSL 1999
  • Computer Science, Mathematics
  • In 1974 Ronald Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form ∃P→Φ, where P→is a tuple of relation symbols. and Φ is a first order formula. Fagin was also the first to study monadic NP: the class of properties expressible by existential second order sentences where all quantified relations are unary. In their very difficult paper [AF90] Ajtai and Fagin show that directed… CONTINUE READING

    Topics from this paper.

    A Toolkit for First Order Extensions of Monadic Games
    • 12
    • PDF
    The Closure of Monadic NP
    • 55
    • PDF
    First order quantifiers in~monadic second order logic
    • 3
    • PDF
    The hierarchy inside closed monadic /spl Sigma//sub 1/ collapses on the infinite binary tree
    • 2
    On complexity of Ehrenfeucht-Fraïssé games
    • 2
    • PDF
    On Complexity of Ehrenfeucht-Fraïssé Games
    • 1
    • PDF
    On the Expressive Power of Graph Logic
    • 7
    Monadische Erweiterungen von monadic NP

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES
    The Closure of Monadic NP
    • 55
    • PDF
    The closure of Monadic NP (extended abstract)
    • 12
    On Monadic NP vs. Monadic co-NP
    • 151
    • PDF
    On Winning Strategies in Ehrenfeucht-Fraïssé Games
    • 35
    • PDF
    Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree
    • 24
    Comparing the Power of Games on Graphs
    • R. Fagin
    • Mathematics, Computer Science
    • 1997
    • 12
    Fagin Monadic Generalized spectra, Zeitschrift fuer Mathematische Logik und Grundlagen der Mathematik
    • 1975
    Fagin On winning strategies in Ehrenfeucht-Fra s e games
    • 1997
    Fagin Reachability is harder for directed than for undirected nite graphs
    • 1990