The following pages link to (Q3204028):
Displaying 20 items.
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- Principles of programming with complex objects and collection types (Q672333) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Procedural languages for database queries and updates (Q751799) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Fundamental properties of deterministic and nondeterministic extensions of Datalog (Q756410) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- The expressive power of the bounded-iteration construct (Q1186517) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Reflective relational machines (Q1271557) (← links)
- Functions over free algebras definable in the simply typed lambda calculus (Q1314357) (← links)
- Non-determinism in logic-based languages (Q1360676) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Comparison of expressive power of some query languages for databases (Q2510772) (← links)
- Complexity and expressive power of second‐order extended Horn logic (Q4915214) (← links)
- (Q5079746) (← links)
- Capturing the polynomial hierarchy by second-order revised Krom logic (Q6135775) (← links)
