On the expressibility and the computability of untyped queries

DOI10.1016/S0168-0072(00)00055-5zbMath1112.68377OpenAlexW2081791214MaRDI QIDQ5936000

Jose Maria Turull Torres

Publication date: 2 July 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(00)00055-5

zbMATH Keywords

Abstract logicAbstract machinesCompleteness of computation modelsQuantifiersQuery computability

Mathematics Subject Classification ID

Database theory (68P15) Model theory of finite structures (03C13) Other infinitary logic (03C75)

Related Items (2)

Computing queries with higher-order logics ⋮ Computable Queries for Object Oriented Databases

Cites Work

• Computing with infinitary logic
• Computable queries for relational data bases
• Reflective relational machines
• Infinitary logic and inductive definability over finite structures
• Horn clause queries and generalizations
• Relational queries computable in polynomial time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the expressibility and the computability of untyped queries