Relational Complexity and Higher Order Logics

DOI10.1007/978-3-319-30024-5_17MaRDI QIDQ2807086zbMATH OpenOpenAlexFDO

Authors Jose Maria Turull Torres

Publication date 19 May 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30024-5_17

Mathematics Subject Classification ID

Higher-order logic (03B16) Logic in computer science (03B70) Database theory (68P15)

Recommendations

• The Relational Polynomial-Time Hierarchy and Second-Order Logic
• Fixpoint logics, relational machines, and computational complexity
• scientific article; zbMATH DE number 4177028
• Relational Logics and Their Applications
• Relational semantics of linear logic and higher-order model checking
• The complexity of hybrid logics over equivalence relations
• Relational Parametricity and Separation Logic
• Relational Parametricity and Separation Logic
• Higher-order computational logic
• RELEVANCE LOGICS AND RELATION ALGEBRAS

Cited in

(6)

• Choiceless polynomial time
• Relations in monadic third-order logic
• A study of homogeneity in relational databases
• scientific article; zbMATH DE number 1302496 (Why is no real title available?)
• Reflective relational machines working on homogeneous databases
• The Relational Polynomial-Time Hierarchy and Second-Order Logic

This page was built for publication: Relational Complexity and Higher Order Logics

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