A Zero-One Law for Logic with a Fixed-Point Operator
暂无分享,去创建一个
[1] Stephen J. Garland. Review: C. Spector, Inductively Defined Sets of Natural Numbers , 1969 .
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[3] Frank Harary,et al. Properties of almost all graphs and complexes , 1979, J. Graph Theory.
[4] David Harel,et al. Structure and Complexity of Relational Queries , 1980, FOCS.
[5] H. Gaifman. Concerning measures in first order calculi , 1964 .
[6] Saharon Shelah,et al. On random models of finite power and monadic logic , 1985, Discrete Mathematics.
[7] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[8] Yuri Gurevich,et al. Toward logic tailored for computational complexity , 1984 .
[9] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[10] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[11] Yiannis N. Moschovakis. On nonmonotone inductive definability , 1974 .
[12] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[13] Alfred V. Aho,et al. Universality of data retrieval languages , 1979, POPL.
[14] Neil Immerman. Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[15] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[16] Dexter Kozen,et al. Results on the Propositional µ-Calculus , 1982, ICALP.
[17] Willem P. de Roever,et al. Recursive program schemes: semantics and proof theory , 1976, Mathematical Centre Tracts.
[18] Ronald Fagin,et al. Probabilities on finite models , 1976, Journal of Symbolic Logic.
[19] Larry Joseph Stockmeyer,et al. The complexity of decision problems in automata theory and logic , 1974 .
[20] W. Deroever,et al. A calculus for recursive program schemes , 1972 .
[21] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[22] Yiannis N. Moschovakis,et al. Elementary induction on abstract structures , 1974 .
[23] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..
[24] Willem P. de Roever,et al. A Calculus for Recursive Program Schemes , 1972, ICALP.
[25] W. P. deRoever. Recursive program schemes: semantics and proof theory , 1976 .
[26] Peter Freyd,et al. Aspects of topoi , 1972, Bulletin of the Australian Mathematical Society.