Publications

Export 6 results:
Filters: Author is Peter Schuster  [Clear All Filters]
In Press
Steila, S.: A combinatorial bound for a restricted form of the Termination Theorem. In: Schuster, P., Seisenberger, M., and Weiermann, A. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Springer (In Press).
2016
Probst, D., Schuster, P.: Concepts of Proof in Mathematics, Philosophy, and Computer Science. Walter De Gruyter Incorporated (2016).
Kokkinis, I., Studer, T.: Cyclic Proofs for Linear Temporal Logic. In: Probst, D. and Schuster, P. Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
Buchholtz, U.Torben, Jäger, G., Strahm, T.: Theories of proof-theoretic strength $\psi$($\Gamma_{\Omega+1}$). In: Probst, D. and Schuster, P. Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).