Fixed-Point Extensions of First-Order Logic
暂无分享,去创建一个
[1] Yiannis N. Moschovakis. On nonmonotone inductive definability , 1974 .
[2] J. D. Uiiman,et al. Principles of Database Systems , 2004, PODS 2004.
[3] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[4] Harvey M. Friedman. The complexity of explicit definitions , 1976 .
[5] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..
[6] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[7] Yiannis N. Moschovakis,et al. Elementary induction on abstract structures , 1974 .
[8] R. Lyndon. An interpolation theorem in the predicate calculus. , 1959 .
[9] Peter Aczel,et al. An Introduction to Inductive Definitions , 1977 .
[10] Alfred V. Aho,et al. Universality of data retrieval languages , 1979, POPL.
[11] Leo Harrington,et al. On monotone vs. nonmonotone induction , 1976 .
[12] Yuri Gurevich,et al. Monotone versus positive , 1987, JACM.
[13] Yuri Gurevich,et al. Toward logic tailored for computational complexity , 1984 .
[14] Wayne Richter. Recursively Mahlo Ordinals and Inductive Definitions , 1971 .
[15] Saharon Shelah,et al. Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[16] Stephen J. Garland. Review: C. Spector, Inductively Defined Sets of Natural Numbers , 1969 .
[17] Willem P. de Roever,et al. A Calculus for Recursive Program Schemes , 1972, ICALP.
[18] Andreas Blass,et al. A Zero-One Law for Logic with a Fixed-Point Operator , 1986, Inf. Control..