Switch to: Citations

References in:

Reachability is harder for directed than for undirected finite graphs

Miklos Ajtai & Ronald Fagin

Journal of Symbolic Logic 55 (1):113-150 (1990)

Add references

You must login to add references.

¹1-formulae on finite structures.M. Ajtai - 1983 - Annals of Pure and Applied Logic 24 (1):1.details Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic Direct download (3 more) Export citation Bookmark 26 citations
Relationships between Nondeterministic and Deterministic Tape Complexities.Walter J. Savitch - 1974 - Journal of Symbolic Logic 39 (2):346-347.details Logic and Philosophy of Logic Direct download Export citation Bookmark 15 citations
Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.details Logic and Philosophy of Logic Direct download Export citation Bookmark 223 citations
Monadic generalized spectra.Ronald Fagin - 1975 - Mathematical Logic Quarterly 21 (1):89-96.details Generalized Quantifiers in Philosophy of Language Direct download Export citation Bookmark 25 citations
Second‐order and Inductive Definability on Finite Structures.Michel De Rougemont - 1987 - Mathematical Logic Quarterly 33 (1):47-63.details Areas of Mathematics in Philosophy of Mathematics Direct download Export citation Bookmark 6 citations
Second-order and Inductive Definability on Finite Structures.Michel De Rougemont - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):47-63.details Areas of Mathematics in Philosophy of Mathematics Direct download Export citation Bookmark 6 citations

1