Author:
Berger Ulrich,Buchholz Wilfried,Schwichtenberg Helmut
Reference19 articles.
1. Extracting constructive content from classical logic via control-like reductions;Barbanera,1993
2. U. Berger, Programs from classical proofs, in: M. Behara, R. Fritsch, R.G. Lintz (Eds.), Symposia Gaussiana, Proc. 2nd Gauss Symp., Conf. A: Mathematics and Theoretical Physics. Munich, Germany, August 2–7, 1993, Walter de Gruyter, Berlin, 1995, pp. 187–200.
3. U. Berger, H. Schwichtenberg, Program extraction from classical proofs, in: D. Leivant (Ed.), Logic and Computational Complexity, International Workshop LCC’94, Indianapolis, IN, USA, October 1994, Lecture Notes in Computer Science, vol. 960, Springer, Berlin, 1995, pp. 77–97.
4. The Warshall algorithm and Dickson's lemma;Berger;J. Automat. Reason.,2001
5. Finding computational content in classical proofs;Constable,1991
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Modal Functional (Dialectica) Interpretation;Logical Methods in Computer Science;2021-10-25
2. Cut-Elimination with Depths;Ordinal Analysis with an Introduction to Proof Theory;2020
3. On synthetic undecidability in Coq, with an application to the Entscheidungsproblem;Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019;2019
4. Eliminating disjunctions by disjunction elimination;Indagationes Mathematicae;2018-02
5. Extraction of Expansion Trees;Journal of Automated Reasoning;2018-01-27