Higher-Order Quantification and Proof Search (2002)
Cached
Download Links
- [www.cse.psu.edu]
- [www.lix.polytechnique.fr]
- [www.lix.polytechnique.fr]
- DBLP
Other Repositories/Bibliography
by
Dale Miller
| Venue: | In Proceedings of the AMAST confrerence, LNCS |
| Citations: | 7 - 4 self |
BibTeX
@INPROCEEDINGS{Miller02higher-orderquantification,
author = {Dale Miller},
title = {Higher-Order Quantification and Proof Search},
booktitle = {In Proceedings of the AMAST confrerence, LNCS},
year = {2002},
pages = {60--74},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Logical equivalence between logic programs that are firstorder logic formulas holds between few logic programs, partly because first-order logic does not allow auxiliary programs and data structures to be hidden. As a result of not having such abstractions, logical equivalence will force these auxiliaries to be present in any equivalence program.
