The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas

DOI10.1145/321510.321524zbMath0182.33202OpenAlexW2120127771MaRDI QIDQ5572333

Robert A. Di Paola

Publication date: 1969

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321510.321524

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (10)

Translation of first order formulas into ground formulas via a completion theory ⋮ Domain-independent formulas and databases ⋮ Efficient Evaluation of Arbitrary Relational Calculus Queries ⋮ The decision problem for database dependencies ⋮ Constructibility and decidability versus domain independence and absoluteness ⋮ Unnamed Item ⋮ Monitoring Metric First-Order Temporal Properties ⋮ A Framework for Formalizing Set Theories Based on the Use of Static Set Terms ⋮ Schema Mappings: A Case of Logical Dynamics in Database Theory ⋮ Finite queries do not have effective syntax.

This page was built for publication: The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas