Delta-Languages for Sets and sub-PTIME Graphs Transformers
暂无分享,去创建一个
[1] Johann A. Makowsky,et al. The Choice of Programming Primitives for SETL-Like Programming Languages , 1986, ESOP.
[2] Vladimir Yu. Sazonov,et al. Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability , 1993, Theor. Comput. Sci..
[3] Elias Dahlhaus,et al. Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach , 1987, CSL.
[4] Vladimir Yu. Sazonov. On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation , 1981, MFCS.
[5] Vladimir Yu. Sazonov,et al. Bounded Set Theory and Polynominal Computability , 1987, FCT.
[6] A. Levy,et al. A hierarchy of formulas in set theory , 1965 .
[7] Victor Vianu,et al. Tractable query languages for complex object databases , 1991, PODS '91.
[8] Vladimir Yu. Sazonov,et al. A Logical Approach to the Problem "P=NP?" , 1980, MFCS.
[9] Neil Immerman,et al. Descriptive and Computational Complexity , 1989, FCT.
[10] Frank Wm. Tompa,et al. Efficiently updating materialized views , 1986, SIGMOD '86.
[11] Egon Börger,et al. Trends in theoretical computer science , 1988 .
[12] Gabriel M. Kuper,et al. A new approach to database logic , 1984, PODS.
[13] Catriel Beeri,et al. On the power of languages for manipulation of complex objects , 1987, VLDB 1987.
[14] Yuri Gurevich,et al. Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[15] R. Jensen,et al. The fine structure of the constructible hierarchy , 1972 .
[16] Peter Aczel,et al. Non-well-founded sets , 1988, CSLI lecture notes series.
[17] Neil Immerman,et al. Languages that Capture Complexity Classes , 1987, SIAM J. Comput..
[18] Neil Immerman,et al. The expressiveness of a family of finite set languages , 1991, PODS '91.
[19] Rohit Parikh,et al. Existence and feasibility in arithmetic , 1971, Journal of Symbolic Logic.
[20] Vladimir Yu. Sazonov,et al. A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability , 1994, CSL.