Computing queries with higher-order logics

DOI10.1016/J.TCS.2006.01.009MaRDI QIDQ2369013zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lauri Hella, Jose Maria Turull Torres

Publication date 28 April 2006

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

Full work available at URL https://doi.org/10.1016/j.tcs.2006.01.009

zbMATH Keywords

Descriptive complexityComplete languagesHigher-order logics

Mathematics Subject Classification ID

Database theory (68P15) Descriptive complexity and finite models (68Q19)

Recommendations

• Expressibility of higher order logics
• Foundations of Information and Knowledge Systems
• On fragments of higher order logics that on finite structures collapse to second order
• The expressive power of higher-order Datalog
• Polynomially bounded valuations in higher-order logics over relational databases

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 3909745 (Why is no real title available?)
• scientific article; zbMATH DE number 4008383 (Why is no real title available?)
• scientific article; zbMATH DE number 4064541 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 719756 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Computable queries for relational data bases
• Descriptive characterizations of computational complexity
• Expressibility of higher order logics
• Metafinite model theory
• On the expressibility and the computability of untyped queries
• On the expressive power of database queries with intermediate types
• The polynomial-time hierarchy
• Truth definitions in finite models

Cited in

(10)

• Complete Problems for Higher Order Logics
• Rules with parameters in modal logic. II.
• Resource-bounded martingales and computable Dowd-type generic sets
• Expressibility of higher order logics
• Systematic Refinement of Abstract State Machines with Higher-Order Logic
• Arity and alternation: a proper hierarchy in higher order logics
• The query topology in logic programming
• Polynomially bounded valuations in higher-order logics over relational databases
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
• On fragments of higher order logics that on finite structures collapse to second order

This page was built for publication: Computing queries with higher-order logics

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