Implicit Definability and Infinitary Logic in Finite Model Theory
暂无分享,去创建一个
[1] Saharon Shelah,et al. On finite rigid structures , 1994, Journal of Symbolic Logic.
[2] A. Dawar,et al. Infinitary Logic and Inductive Definability over Finite Structures , 1995, Inf. Comput..
[3] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[4] Steven Lindell,et al. An Analysis of Fixed-Point Queries on Binary Trees , 1991, Theor. Comput. Sci..
[5] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[6] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..
[7] Serge Abiteboul,et al. Generic Computation and its complexity , 1991, STOC '91.
[8] K. Jon Barwise,et al. On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.
[9] Serge Abiteboul,et al. Fixpoint logics, relational machines, and computational complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[10] Phokion G. Kolaitis,et al. Infinitary Logics and 0-1 Laws , 1992, Inf. Comput..
[11] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[12] Phokion G. Kolaitis,et al. Fixpoint logic vs. infinitary logic in finite-model theory , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[13] Phokion G. Kolaitis. Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[14] Phokion G. Kolaitis,et al. Infinitary Logic for Computer Science , 1992, ICALP.
[15] Ashok K. Chandra. Theory of database queries , 1988, PODS '88.
[16] Neil Immerman. Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[17] Leslie G. Valiant,et al. Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..
[18] Neil Immerman,et al. Descriptive and Computational Complexity , 1989, FCT.
[19] A. Dawar. Feasible computation through model theory , 1993 .
[20] S. Abiteboul,et al. Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[21] Yuri Gurevich,et al. Toward logic tailored for computational complexity , 1984 .