Delta-Languages for Sets and sub-PTIME Graphs Transformers

This paper discusses three successively extending versions of a set theoretic Δ-language, as a prototype for “nested” data bases query language. Corresponding finite set operations (data base queries) may be realized in NLOGSPACE under representation of sets by extensional well-founded (acyclic) graphs. (In a previous work for another version of Δ-language an exact correspondence to PTIME-computability was established.) Moreover, each of the mentioned versions of the language is faithfully characterized in terms of corresponding three classes of the graph transformers, the last one being just all transformers definable in the First Order Logic with Transitive Closure operator. For simplicity we are considering here the case of “pure” hereditarily-finite sets, i.e. sets without atoms involved. They are naturally linear ordered, however this order is problematic to formally define in our present case (unlike the case corresponding to PTIME). The related question whether the last class of transformers and corresponding class of queries over HF coincide with all NLOGSPACE-computable ones is left open in this paper.

[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.