# Publications

Export 16 results:
Filters: Author is Dieter Probst  [Clear All Filters]
2016
: Concepts of Proof in Mathematics, Philosophy, and Computer Science. Walter De Gruyter Incorporated (2016).
: Cyclic Proofs for Linear Temporal Logic. In: Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
: Theories of proof-theoretic strength $\psi$($\Gamma_{\Omega+1}$). In: Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
2015
: A proof-theoretic analysis of theories for stratified inductive definitions. In: Gentzen's Centenary: The Quest for Consistency. Springer (2015).
2011
: Admissible closures of polynomial time computable arithmetic. Archive for Mathematical Logic. 50, 643-660 (2011).
Probst, D.: The provably terminating operations of the subsystem PETJ of explicit mathematics. Annals of Pure and Applied Logic. 162, 934-947 (2011).
: The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories. Annals of Pure and Applied logic. 162, 647-660 (2011).
2008
: On contraction and the modal fragment. Mathematical Logic Quarterly. 54, 345-349 (2008).
2004
: Iterating $Σ$ operations in admissible set theory without foundation: a further aspect of metapredicative Mahlo. In: Link, G. One Hundred Years of Russell's Paradox. Papers from the 2001 Munich Russell Conference. pp. 119-134. de Gruyter (2004).
: Variation on a theme of Schütte. Mathematical Logic Quarterly. 50, 258-264 (2004).
2001
: How to normalize the Jay. Theoretical Computer Science. 254, 677-681 (2001).