Resolution in type theory, The Journal of Symbolic Logic, vol.34, issue.03, pp.414-432, 1971. ,
DOI : 10.1073/pnas.49.6.828
Proof Transformation by CERES, Springer Lecture Notes in Computer Science, vol.4108, pp.82-93, 2006. ,
DOI : 10.1007/11812289_8
System Description: The Cut-Elimination System CERES, Proc. ESCoR, pp.159-167, 2006. ,
CERES: An analysis of F??rstenberg???s proof of the infinity of primes, Theoretical Computer Science, vol.403, issue.2-3, pp.160-175, 2008. ,
DOI : 10.1016/j.tcs.2008.02.043
Cut-elimination and Redundancy-elimination by Resolution, Journal of Symbolic Computation, vol.29, issue.2, pp.149-176, 2000. ,
DOI : 10.1006/jsco.1999.0359
Towards a clausal analysis of cut-elimination, Journal of Symbolic Computation, vol.41, issue.3-4, pp.381-410, 2006. ,
DOI : 10.1016/j.jsc.2003.10.005
Simplification of Herbrand Sequents, 2009. ,
Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210, 1934. ,
DOI : 10.1007/BF01201353
Herbrand Sequent Extraction, Lecture Notes in Computer Science, vol.5144, pp.462-477, 2008. ,
DOI : 10.1007/978-3-540-85110-3_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.9347
A Clausal Approach to Proof Analysis in Second-Order Logic, Logical Foundations of Computer Sci, vol.133, issue.1-2, 2009. ,
DOI : 10.1016/B978-044450813-3/50018-7
Herbrand Sequent Extraction, 2008. ,
A General Analysis of Cut-Elimination by CERes, 2009. ,