Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Ajtai, M.
1983.
∑11-Formulae on finite structures.
Annals of Pure and Applied Logic,
Vol. 24,
Issue. 1,
p.
1.
Lynch, James F.
1997.
Structures in Logic and Computer Science.
Vol. 1261,
Issue. ,
p.
66.
Spencer, Joel H.
and
St. John, Katherine
1998.
STACS 98.
Vol. 1373,
Issue. ,
p.
94.
Schwentick, Thomas
1999.
Computer Science Logic.
Vol. 1584,
Issue. ,
p.
9.
Ruhl, M.
1999.
Counting and addition cannot express deterministic transitive closure.
p.
326.
Barrington, D.A.
Immerman, N.
Lautemann, C.
Schweikardt, N.
and
Therien, D.
2001.
The Crane Beach Conjecture.
p.
187.
Lautemann, Clemens
and
Schweikardt, Nicole
2001.
STACS 2001.
Vol. 2010,
Issue. ,
p.
455.
Mix Barrington, David A.
Immerman, Neil
Lautemann, Clemens
Schweikardt, Nicole
and
Thérien, Denis
2005.
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture.
Journal of Computer and System Sciences,
Vol. 70,
Issue. 2,
p.
101.
Roy, Amitabha
and
Straubing, Howard
2006.
STACS 2006.
Vol. 3884,
Issue. ,
p.
489.
Schweikardt, Nicole
2007.
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory.
Information and Computation,
Vol. 205,
Issue. 3,
p.
311.
Roy, Amitabha
and
Straubing, Howard
2007.
Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$.
SIAM Journal on Computing,
Vol. 37,
Issue. 2,
p.
502.
Durand, Arnaud
Lautemann, Clemens
and
More, Malika
2007.
A simple proof of the polylog counting ability of first-order logic.
ACM SIGACT News,
Vol. 38,
Issue. 4,
p.
40.
Eickmeyer, Kord
and
Grohe, Martin
2010.
Computer Science Logic.
Vol. 6247,
Issue. ,
p.
275.
Schweikardt, Nicole
and
Segoufin, Luc
2010.
Addition-Invariant FO and Regularity.
p.
273.
Eickmeyer, Kord
and
Grohe, Martin
2011.
Randomisation and Derandomisation in Descriptive Complexity Theory.
Logical Methods in Computer Science,
Vol. Volume 7, Issue 3,
Issue. ,
Krebs, Andreas
and
Sreejith, A.V.
2012.
Non-definability of Languages by Generalized First-order Formulas over (N,+).
p.
451.