scientific article; zbMATH DE number 1414296

MaRDI QIDQ4942633zbMATH OpenFDO

Authors David Harel

Publication date 16 March 2000

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1222556
• Completeness results for recursive data bases
• Recursive queries and context-free graph grammars
• Recursively indefinite databases
• scientific article; zbMATH DE number 219217

Cited in

(12)

• Deriving structural hylomorphisms from recursive definitions
• Alpha-structural recursion and induction
• scientific article; zbMATH DE number 41858 (Why is no real title available?)
• scientific article; zbMATH DE number 1222556 (Why is no real title available?)
• scientific article; zbMATH DE number 1302872 (Why is no real title available?)
• scientific article; zbMATH DE number 749915 (Why is no real title available?)
• scientific article; zbMATH DE number 874495 (Why is no real title available?)
• Theorem Proving in Higher Order Logics
• CONCUR 2005 – Concurrency Theory
• A review on existence of various recurrent like structures
• A complete and recursive feature theory
• Recursive queries and context-free graph grammars

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942633)