The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
From MaRDI portal
Publication:5572333
DOI10.1145/321510.321524zbMath0182.33202MaRDI QIDQ5572333
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
Related Items
A Framework for Formalizing Set Theories Based on the Use of Static Set Terms, Domain-independent formulas and databases, The decision problem for database dependencies, Finite queries do not have effective syntax., Constructibility and decidability versus domain independence and absoluteness