Existential Fixed-Point Logic, Universal Quantifiers, and Topoi
暂无分享,去创建一个
[1] Stephen A. Cook,et al. Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..
[2] A. Grothendieck,et al. Théorie des Topos et Cohomologie Etale des Schémas , 1972 .
[3] E. Börger. Computation Theory and Logic , 1987, Lecture Notes in Computer Science.
[4] David Harel,et al. Horn Clauses Queries and Generalizations , 1985, J. Log. Program..
[5] Neil Immerman,et al. Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.
[6] John W. Gray,et al. Categories in Computer Science and Logic , 1989 .
[7] Andreas Blass,et al. The Underlying Logic of Hoare Logic , 2000, Bull. EATCS.
[8] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[9] Andreas Blass,et al. Existential Fixed-Point Logic , 1987, Computation Theory and Logic.
[10] Andreas Blass. Topoi and Computation , 1993, Current Trends in Theoretical Computer Science.
[11] Andreas Blass,et al. Classifying topoi and finite forcing , 1983 .
[12] Krzysztof R. Apt,et al. Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.
[13] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..