Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Benda, Miroslav
1977.
Non-Classical Logics, Model Theory, And Computability.
Vol. 89,
Issue. ,
p.
117.
Fagin, Ronald
1977.
The number of finite relational structures.
Discrete Mathematics,
Vol. 19,
Issue. 1,
p.
17.
Keisler, H. Jerome
1977.
Logic Colloquium 76, Proceedings of a conference.
Vol. 87,
Issue. ,
p.
5.
Bollobás, Béla
1979.
Graph Theory.
Vol. 63,
Issue. ,
p.
123.
Blass, Andreas
and
Harary, Frank
1979.
Properties of almost all graphs and complexes.
Journal of Graph Theory,
Vol. 3,
Issue. 3,
p.
225.
Lynch, James F.
1980.
Almost sure theories.
Annals of Mathematical Logic,
Vol. 18,
Issue. 2,
p.
91.
Harary, Frank
1980.
Graph theoretic models.
Theoretical Computer Science,
Vol. 11,
Issue. 2,
p.
117.
Immerman, Neil
1980.
Upper and lower bounds for first order expressibility.
p.
74.
Immerman, Neil
1981.
Number of quantifiers is better than number of tape cells.
Journal of Computer and System Sciences,
Vol. 22,
Issue. 3,
p.
384.
Oberschelp, W.
1982.
Combinatorial Theory.
Vol. 969,
Issue. ,
p.
276.
Immerman, Neil
1982.
Upper and lower bounds for first order expressibility.
Journal of Computer and System Sciences,
Vol. 25,
Issue. 1,
p.
76.
Fagin, Ronald
Maier, David
Ullman, Jeffrey D.
and
Yannakakis, Mihalis
1983.
Tools for Template Dependencies.
SIAM Journal on Computing,
Vol. 12,
Issue. 1,
p.
36.
Grandjean, Etienne
1983.
Complexity of the first-order theory of almost all finite structures.
Information and Control,
Vol. 57,
Issue. 2-3,
p.
180.
Möhring, Rolf H.
1984.
Almost all comparability graphs are UPO.
Discrete Mathematics,
Vol. 50,
Issue. ,
p.
63.
Möhring, R.H.
and
Radermacher, F.J.
1984.
Algebraic and Combinatorial Methods in Operations Research, Proceedings of the Workshop on Algebraic Structures in Operations Research.
Vol. 95,
Issue. ,
p.
257.
Kaufmann, Matt
and
Shelah, Saharon
1985.
On random models of finite power and monadic logic.
Discrete Mathematics,
Vol. 54,
Issue. 3,
p.
285.
Blass, Andreas
Gurevich, Yuri
and
Kozen, Dexter
1985.
A zero-one law for logic with a fixed-point operator.
Information and Control,
Vol. 67,
Issue. 1-3,
p.
70.
Hoover, Douglas N.
1986.
Probabilities on models of universal sentences.
Proceedings of the American Mathematical Society,
Vol. 98,
Issue. 2,
p.
294.
Babai, L.
and
Turán, Gy.
1987.
The Complexity of Defining a Relation on a Finite Graph.
Mathematical Logic Quarterly,
Vol. 33,
Issue. 3,
p.
277.
Compton, Kevin J.
Ward Henson, C.
and
Shelah, Saharon
1987.
Nonconvergence, undecidability, and intractability in asymptotic problems.
Annals of Pure and Applied Logic,
Vol. 36,
Issue. ,
p.
207.