# Publications

Export 283 results:
2004
Strahm, T.: A proof-theoretic characterization of the basic feasible functionals. Theoretical Computer Science. 329, 159-176 (2004).
Jäger, G.: An intensional fixed point theory over first order arithmetic. Annals of Pure and Applied Logic. 128, 197-213 (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).
: On modal $μ$-calculus and non-well-founded set theory. Journal of Philosophical Logic. 33, 343-360 (2004).
: Variation on a theme of Schütte. Mathematical Logic Quarterly. 50, 258-264 (2004).
2003
Tupailo, S.: Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe. Annals of Pure and Applied Logic. 120, 165-196 (2003).
Rüede, C.: The proof-theoretic analysis of $Σ^1_1$ transfinite dependent choice. Annals of Pure and Applied Logic. 122, 195-234 (2003).
Strahm, T.: Theories with self-application and computational complexity. Information and Computation. 185, 263-297 (2003).
Rüede, C.: Universes in metapredicative analysis. Archive for Mathematical Logic. 42, 129-151 (2003).
2002
: Extending the system $\mathsf{T}_0$ of explicit mathematics: the limit and Mahlo axioms. Annals of Pure and Applied Logic. 114, 79-101 (2002).
: Intuitionistic fixed point theories for strictly positive operators. Mathematical Logic Quarterly. 48, 195-202 (2002).
: Proof theoretic complexity. In: Proof and System Reliability. pp. 369-398. Springer (2002).
Alberucci, L.: Strictness of the modal $μ$-calculus hierarchy. In: Automata, Logics and infinite Games: A Guide to Current Research. pp. 185-201. Springer (2002).
: The proof-theoretic analysis of the Suslin operator in applicative theories. In: Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman. pp. 270-292. AK Peters (2002).
Rüede, C.: Transfinite dependent choice and $\omega$-model reflection. The Journal of Symbolic Logic. 67, 1153-1168 (2002).
Strahm, T.: Wellordering proofs for metapredicative Mahlo. The Journal of Symbolic Logic. 67, 260-278 (2002).
2001
Studer, T.: A semantics for $\lambda^{\{\}}_{\mathsf str}$: a calculus with overloading and late-binding. Journal of Logic and Computation. 11, 527-544 (2001).
Studer, T.: Constructive foundations for Featherweight Java. In: Proceedings of the International Seminar on Proof Theory in Computer Science. pp. 202-238. Springer (2001).
Jäger, G.: First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo. The Journal of Symbolic Logic. 66, 1073-1089 (2001).