Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Barwise, Jon
1981.
The role of the Omitting Types Theorem in infinitary logic.
Archiv für Mathematische Logik und Grundlagenforschung,
Vol. 21,
Issue. 1,
p.
55.
Moschovakis, Yiannis N.
1984.
Computation and Proof Theory.
Vol. 1104,
Issue. ,
p.
289.
Agodi, A.
Di Toro, M.
and
Anile, A. M.
1985.
Mathematical and physical problems in nuclear fluid dynamics.
Il Nuovo Cimento A,
Vol. 87,
Issue. 2,
p.
89.
Kanellakis, Paris C.
1986.
ICDT '86.
Vol. 243,
Issue. ,
p.
1.
De Rougemont, Michel
1987.
Second‐order and Inductive Definability on Finite Structures.
Mathematical Logic Quarterly,
Vol. 33,
Issue. 1,
p.
47.
Kanellakis, Paris C.
1988.
Foundations of Deductive Databases and Logic Programming.
p.
547.
Leivant, Daniel
1989.
Descriptive characterizations of computational complexity.
Journal of Computer and System Sciences,
Vol. 39,
Issue. 1,
p.
51.
Lubarsky, R.S.
1989.
mu -definable sets of integers.
p.
343.
Kolaitis, Phokion G.
and
Papadimitriou, Christos H.
1990.
Some computational aspects of circumscription.
Journal of the ACM,
Vol. 37,
Issue. 1,
p.
1.
McColm, G.L.
1991.
A Ramseyian theorem on products of trees.
Journal of Combinatorial Theory, Series A,
Vol. 57,
Issue. 1,
p.
68.
Eiter, Thomas
and
Gottlob, Georg
1997.
Expressiveness of stable model semantics for disjunctive logic programs with functions.
The Journal of Logic Programming,
Vol. 33,
Issue. 2,
p.
167.
Flum, Jörg
1998.
An Extension of the Lemma of Rasiowa and Sikorski.
Mathematical Logic Quarterly,
Vol. 44,
Issue. 4,
p.
509.
Kolaitis, P.G.
and
Ottot, M.
1998.
On the boundedness problem for two-variable first-order logic.
p.
513.
Buss, S.
1999.
1998 European Summer Meeting of the Association for Symbolic Logic.
Bulletin of Symbolic Logic,
Vol. 5,
Issue. 1,
p.
59.
Otto, Martin
1999.
STACS 99.
Vol. 1563,
Issue. ,
p.
531.
Kupferman, Orna
and
Vardi, MosheY.
2001.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 2250,
Issue. ,
p.
24.
Keisler, H. Jerome
and
Knight, Julia F.
2004.
Barwise: Infinitary Logic and Admissible Sets.
Bulletin of Symbolic Logic,
Vol. 10,
Issue. 1,
p.
4.
Goncharov, S. S.
Harizanov, V. S.
Knight, J. F.
Morozov, A. S.
and
Romina, A. V.
2005.
On Automorphic Tuples of Elements in Computable Models.
Siberian Mathematical Journal,
Vol. 46,
Issue. 3,
p.
405.
Otto, M.
2006.
The Boundedness Problem for Monadic Universal First-Order Logic.
p.
37.
Kreutzer, Stephan
Otto, Martin
and
Schweikardt, Nicole
2007.
Automata, Languages and Programming.
Vol. 4596,
Issue. ,
p.
571.