Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference22 articles.
1. Brotherston, J.: Sequent calculus proof systems for inductive definitions. PhD thesis, University of Edinburgh (2006)
2. Brotherston, J., Simpson, A.: Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6), 1177–1216 (2011). https://doi.org/10.1093/logcom/exq052
3. Gentzen, G.: Untersuchungen über das logische schließen. I. Mathematische Zeitschrift 39, 176–210 (1935). https://doi.org/10.1007/BF01201353
4. Brotherston, J., Gorogiannis, N., Petersen, R.L.: A generic cyclic theorem prover. In: APLAS-10 (10th Asian Symposium on Programming Languages and Systems). LNCS. https://doi.org/10.1007/978-3-642-35182-2_25, vol. 7705, pp 350–367. Springer (2012)
5. Michel, M.: Complementation is more difficult with automata on infinite words. Technical report CNET (1988)