Computing queries with higher-order logics

DOI10.1016/J.TCS.2006.01.009zbMATH Open1088.68047DBLPjournals/tcs/HellaT06OpenAlexW2022519515WikidataQ55954612 ScholiaQ55954612MaRDI QIDQ2369013FDOQ2369013

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

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

zbMATH Keywords

Descriptive complexityComplete languagesHigher-order logics

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Computable queries for relational data bases
• Title not available (Why is that?)
• The polynomial-time hierarchy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Metafinite model theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the expressive power of database queries with intermediate types
• Truth definitions in finite models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Expressibility of higher order logics
• Descriptive characterizations of computational complexity
• On the expressibility and the computability of untyped queries

Cited In (10)

• Complete Problems for Higher Order Logics
• Rules with parameters in modal logic. II.
• Expressibility of higher order logics
• Resource-bounded martingales and computable Dowd-type generic sets
• 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)