Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Gurevich, Yuri
1982.
Logic, Methodology and Philosophy of Science VI, Proceedings of the Sixth International Congress of Logic, Methodology and Philosophy of Science.
Vol. 104,
Issue. ,
p.
179.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
456.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
370.
Seese, D.
1991.
The structure of the models of decidable monadic theories of graphs.
Annals of Pure and Applied Logic,
Vol. 53,
Issue. 2,
p.
169.
Makowsky, J. A.
and
Ravve, E. V.
1995.
Mathematical Foundations of Computer Science 1995.
Vol. 969,
Issue. ,
p.
540.
Thomas, Wolfgang
1997.
Structures in Logic and Computer Science.
Vol. 1261,
Issue. ,
p.
118.
Courcelle, B.
Makowsky, J. A.
and
Rotics, U.
1998.
Graph-Theoretic Concepts in Computer Science.
Vol. 1517,
Issue. ,
p.
1.
Moller, F.
and
Rabinovich, L.
1999.
On the expressive power of CTL.
p.
360.
Kuske, Dietrich
2001.
STACS 2001.
Vol. 2010,
Issue. ,
p.
443.
Courcelle, B.
Makowsky, J.A.
and
Rotics, U.
2001.
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic.
Discrete Applied Mathematics,
Vol. 108,
Issue. 1-2,
p.
23.
Gurevich, Y.
and
Shelah, S.
2003.
Spectra of monadic second-order formulas with one unary function.
p.
291.
Kuske, Dietrich
2003.
Towards a language theory for infinite N-free pomsets.
Theoretical Computer Science,
Vol. 299,
Issue. 1-3,
p.
347.
Moller, Faron
and
Rabinovich, Alexander
2003.
Counting on CTL*: on the expressive power of monadic path logic.
Information and Computation,
Vol. 184,
Issue. 1,
p.
147.
Makowsky, J.A.
2004.
Algorithmic uses of the Feferman–Vaught Theorem.
Annals of Pure and Applied Logic,
Vol. 126,
Issue. 1-3,
p.
159.
Chateau, A
2004.
On the complexity of decision using destinies in H-bounded structures.
Theoretical Computer Science,
Vol. 322,
Issue. 1,
p.
41.
Rabinovich, Alexander
2005.
Composition Theorems for Generalized Sum and Recursively Defined Types.
Electronic Notes in Theoretical Computer Science,
Vol. 123,
Issue. ,
p.
209.
Rabinovich, Alexander
2007.
On compositionality and its limitations.
ACM Transactions on Computational Logic,
Vol. 8,
Issue. 1,
p.
4.
Fischer, Eldar
and
Makowsky, Johann A.
2008.
Pillars of Computer Science.
Vol. 4800,
Issue. ,
p.
266.
Colcombet, Thomas
2010.
Factorization forests for infinite words and applications to countable scattered linear orderings.
Theoretical Computer Science,
Vol. 411,
Issue. 4-5,
p.
751.
Thomas, Wolfgang
2010.
Fields of Logic and Computation.
Vol. 6300,
Issue. ,
p.
615.