Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation, 106 (1): 109–157, 1993.
2. H. A. Blair. The recursion-theoretic complexity of the semantics of predicate logic as a programming language. Information and Control, 54: 25–47, 1982.
3. H. A. Blair and A. L. Brown. Definite clause programs are canonical (over a suitable domain). Annals of Mathematics and Artificial Intelligence, 1: 1–19, 1990.
4. B. Blankertz and A. Weiermann. How to characterize provably total functions by the Buchholz operator method. This volume.
5. W. Buchholz. A simplified version of local predicativity. In P. Aczel, H. Simmons, and S. S. Wainer, editors, Proof Theory. A selection of papers from the Leeds Proof Theory Programme 1990, pages 115–147. Cambridge University Press, 1992.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献