@inproceedings{e9d96a33748543a5ad4d4dcf66dbc610,
title = "The intractability of validity in logic programming and dynamic logic",
author = "Blair, {Howard A.}",
note = "Funding Information: This result (with equality) is derivable from the u-completeness theorem, which, in turn, is derivable from the Henkin-Orey omitting types theorem. For the details of this tale see any of [M76,thm 30.10], [S67,sec 8.5, and prob. 8.11], [CK73, sec 2.2], [He54], or [056]. The lemma is also implicit in results given in [Hi 78, thm 5.16]. The interest in this lemma in the present context lies in its *The preparation of this paper was supported under a grant DOE administered by the DEP of Argonne National Laboratory.; Workshop on Logics of Programs, 1983 ; Conference date: 06-06-1983 Through 08-06-1983",
year = "1984",
doi = "10.1007/3-540-12896-4_355",
language = "English (US)",
isbn = "9783540128960",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "57--67",
editor = "Edmund Clarke and Dexter Kozen",
booktitle = "Logics of Programs - Workshop",
}