Computing with infinitary logic

DOI10.1016/0304-3975(95)00027-TMaRDI QIDQ672337zbMATH OpenFDO

Authors Moshe Y. Vardi, Victor Vianu, Serge Abiteboul

Publication date 28 February 1997

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

zbMATH Keywords

query languagesinfinitary logic

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27)

Recommendations

• Infinite computation, co-induction and computational logic
• Reasoning about infinite computations
• scientific article; zbMATH DE number 3888910
• scientific article; zbMATH DE number 139622
• Logic programming with infinite sets
• scientific article; zbMATH DE number 29724
• scientific article; zbMATH DE number 4025396
• Intuitionistic computability logic

Cites work

• scientific article; zbMATH DE number 3941493 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1142327 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3349780 (Why is no real title available?)
• Computable queries for relational data bases
• Computing on structures
• Computing with first-order logic
• Datalog extensions for database queries and updates
• Finite-model theory -- A personal perspective
• Fixpoint logics, relational machines, and computational complexity
• Infinitary logic and inductive definability over finite structures
• Infinitary logics and 0-1 laws
• On Moschovakis closure ordinals
• On datalog vs polynomial time
• On uniformity within \(NC^ 1\)
• Relational queries computable in polynomial time
• Structure and complexity of relational queries

Cited in

(14)

• The Relational Polynomial-Time Hierarchy and Second-Order Logic
• Logic programming with infinite sets
• Topological queries in spatial databases
• On the expressibility and the computability of untyped queries
• Adding for-loops to first-order logic
• Computable queries for object oriented databases
• Infinitary logic for computer science
• Reflective relational machines
• Computing with Infinite Terms and Infinite Reductions
• Computing with first-order logic
• Reasoning about infinite computations
• Computing on structures
• scientific article; zbMATH DE number 3888910 (Why is no real title available?)
• scientific article; zbMATH DE number 139622 (Why is no real title available?)

This page was built for publication: Computing with infinitary logic

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