Author:
Sarnat Jeffrey,Schürmann Carsten
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Tahhan Bittar, E.: Strong normalization proofs for cut-elimination in Gentzen’s sequent calculi. In: Proceedings of the Symposium: Algebra and Computer Science. Helena Rasiowa in memoriam, vol. 46, pp. 179–225. Banach Center Publications (1999)
2. Brotherston, J.: Sequent Calculus Proof Systems for Inductive Definitions. PhD thesis, University of Edinburgh (November 2006)
3. Buchholz, W.: Proof-theoretic analysis of termination proofs. Ann. Pure Appl. Logic 75(1-2), 57–65 (1995)
4. Dershowitz, N., Okada, M.: Proof-theoretic techniques for term rewriting theory. In: LICS, pp. 104–111. IEEE Computer Society Press, Los Alamitos (1988)
5. Dyckhoff, R., Pinto, L.: Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica 60(1), 107–118 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献