# Publications

Export 296 results:
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).
: Formalizing non-termination of recursive programs. Journal of Logic and Algebraic Programming. 49, 1-14 (2001).
: How to normalize the Jay. Theoretical Computer Science. 254, 677-681 (2001).
Tupailo, S.: Realization of analysis into explicit mathematics. The Journal of Symbolic Logic. 66, 1848-1864 (2001).
: Universes in explicit mathematics. Annals of Pure and Applied Logic. 109, 141-162 (2001).
: Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory. The Journal of Symbolic Logic. 66, 935-958 (2001).
2000
: A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning. 24, 297-317 (2000).
: A theory of explicit mathematics equivalent to ${ \mathsf{ID} }_1$. In: Proceedings of Computer Science Logic. pp. 356-370. Springer (2000).