Relational Complexity and Higher Order Logics

DOI10.1007/978-3-319-30024-5_17zbMATH Open1475.68112OpenAlexW2465090108MaRDI QIDQ2807086FDOQ2807086

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

Recommendations

• The Relational Polynomial-Time Hierarchy and Second-Order Logic
• Fixpoint logics, relational machines, and computational complexity
• scientific article
• 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
• scientific article; zbMATH DE number 1926604
• RELEVANCE LOGICS AND RELATION ALGEBRAS

Mathematics Subject Classification ID

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

Cited In (4)

• Choiceless polynomial time
• Relations in monadic third-order logic
• Title not available (Why is that?)
• 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)