\(\Delta\)-languages for sets and LOGSPACE computable graph transformers

DOI10.1016/S0304-3975(96)00174-0zbMath0903.68057MaRDI QIDQ1392148

Vladimir Yu. Sazonov, Alexej P. Lisitsa

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

relational databases; acyclic graphs

Mathematics Subject Classification ID

68P15: Database theory

Related Items

Linear ordering on graphs, anti-founded sets and polynomial time computability

Cites Work

• The expressiveness of a family of finite set languages
• A logical-functional approach to data bases
• Query languages for hierarchic databases
• Strengthening of the theorems on polynomial queries
• Hereditarily-finite sets, data bases and polynomial-time computability
• Tractable query languages for complex object databases
• On equivalence between polynomial constructivity of Markov's principle and \(P=NP\)
• Relational queries computable in polynomial time
• Languages that Capture Complexity Classes
• The collection principle and the existential quantifier
• Local class field theory
• Evolving Algebras 1993: Lipari Guide
• A hierarchy of formulas in set theory
• Existence and feasibility in arithmetic
• The fine structure of the constructible hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item