Computing queries with higher-order logics

DOI10.1016/j.tcs.2006.01.009zbMath1088.68047OpenAlexW2022519515WikidataQ55954612 ScholiaQ55954612MaRDI QIDQ2369013

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)

Related Items (5)

Systematic Refinement of Abstract State Machines with Higher-Order Logic ⋮ Arity and alternation: a proper hierarchy in higher order logics ⋮ Rules with parameters in modal logic. II. ⋮ The Descriptive Complexity of the Deterministic Exponential Time Hierarchy ⋮ Resource-bounded martingales and computable Dowd-type generic sets

Cites Work

• Descriptive characterizations of computational complexity
• Computable queries for relational data bases
• On the expressive power of database queries with intermediate types
• The polynomial-time hierarchy
• Metafinite model theory
• Expressibility of Higher Order Logics
• Truth definitions in finite models
• On the expressibility and the computability of untyped queries
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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