On the expressive power of variable-confined logics
暂无分享,去创建一个
[1] Alfred V. Aho,et al. Universality of data retrieval languages , 1979, POPL.
[2] Neil Immerman,et al. Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..
[3] Phokion G. Kolaitis,et al. The decision problem for the probabilities of higher-order properties , 1987, STOC.
[4] Gregory L. McColm. When Is Arithmetic Possible? , 1990, Ann. Pure Appl. Log..
[5] Lauri Hella,et al. The expressive Power of Finitely Many Generalized Quantifiers , 1995, Inf. Comput..
[6] K. Jon Barwise,et al. On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.
[7] Neil Immerman,et al. DSPACE (n/sup k/)=VAR(k+1) , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[8] Gregory L. McColm. Simple and simultaneous recursive fixed points , 1986 .
[9] Ashok K. Chandra. Theory of database queries , 1988, PODS '88.
[10] Lauri Hella,et al. The expressive power of finitely many generalized quantifiers , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[11] A. Dawar. Feasible computation through model theory , 1993 .
[12] Neil Immerman. Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[13] Phokion G. Kolaitis. On Asymptotic Probability of Inductive Queries and Their Decision Problem , 1985, Logic of Programs.
[14] Serge Abiteboul,et al. Computing with First-Order Logic , 1995, J. Comput. Syst. Sci..
[15] Neil Immerman,et al. McColm's Conjecture , 1994, LICS 1994.
[16] 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.
[17] Neil Immerman,et al. McColm's conjecture [positive elementary inductions] , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[18] Phokion G. Kolaitis,et al. Infinitary Logics and 0-1 Laws , 1992, Inf. Comput..
[19] Yiannis N. Moschovakis,et al. Elementary induction on abstract structures , 1974 .
[20] Moshe Y. Vardi. On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.
[21] Neil Immerman. DSPACE[n k ] = VAR[k+1]. , 1991 .
[22] Serge Abiteboul,et al. Fixpoint logics, relational machines, and computational complexity , 1997, JACM.
[23] Ronald Fagin,et al. Monadic generalized spectra , 1975, Math. Log. Q..
[24] Moshe Y. Vardi. On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.
[25] 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.
[26] Gregory L. McColm,et al. Parametrization over Inductive Relations of a Bounded Number of Variables , 1990, Ann. Pure Appl. Log..
[27] Y. Moschovakis. Elementary induction on abstract structures (Studies in logic and the foundations of mathematics) , 1974 .
[28] Phokion G. Kolaitis,et al. Infinitary Logic for Computer Science , 1992, ICALP.
[29] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[30] A. Dawar,et al. Infinitary Logic and Inductive Definability over Finite Structures , 1995, Inf. Comput..
[31] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[32] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..