# Publications

Export 284 results:
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).
Strahm, T.: Autonomous fixed point progressions and fixed point transfinite recursion. In: Proceedings of Logic Colloquium '98. pp. 449-464. AK Peters (2000).
Tupailo, S.: Finitary reductions for local predicativity, I: recursively regular ordinals. In: Proceedings of Logic Colloquium '98. pp. 465-499. AK Peters (2000).
: Fixed point theories and dependent choice. Archive for Mathematical Logic. 39, 493-508 (2000).
Kahle, R.: N-strictness in applicative theories. Archive for Mathematical Logic. 39, 125-144 (2000).
Strahm, T.: The non-constructive $μ$-operator, fixed point theories with ordinals, and the bar rule. Annals of Pure and Applied Logic. 104, 305-324 (2000).
: The unfolding of non-finitist arithmetic. Annals of Pure and Applied Logic. 104, 75-96 (2000).