Inductive definitions over finite structures

[1]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[2]  Yiannis N. Moschovakis,et al.  Abstract first order computability. II , 1969 .

[3]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[4]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5]  Jean-Claude Raoult,et al.  On graph rewritings , 1984, Bull. EATCS.

[6]  Yuri Gurevich,et al.  Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Yuri Gurevich,et al.  Toward logic tailored for computational complexity , 1984 .

[8]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[10]  Andreas Blass,et al.  Henkin quantifiers and complete problems , 1986, Ann. Pure Appl. Log..

[11]  Yuri Gurevich,et al.  Monotone versus positive , 1987, JACM.

[12]  Serge Abiteboul,et al.  Procedural and declarative database update languages , 1988, PODS '88.

[13]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.