# Publications

Export 296 results:
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).
1999
: Bar induction and $\omega$ model reflection. Annals of Pure and Applied Logic. 97, 221-230 (1999).
: Epsilon-substitution method for the ramified language and $Δ^1_1$-comprehension rule. In: Logic and Foundation of Mathematics. pp. 107-130. Kluwer (1999).
Strahm, T.: First steps into metapredicativity in explicit mathematics. In: Sets and Proofs. pp. 383-402. Cambridge University Press (1999).
: On applicative theories. In: Logic and Foundations of Mathematics. pp. 83-92. Kluwer (1999).
: The proof-theoretic analysis of transfinitely iterated fixed point theories. The Journal of Symbolic Logic. 64, 53-67 (1999).
1998
Schwendimann, S.: A new one-pass tableau calculus for $\mathsf{PLTL}$. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 277-292. Springer (1998).
: A proof-theoretic framework for logic programming. In: Buss, S.S. Handbook of Proof Theory. pp. 639-682. North-Holland (1998).
: Comparison of Theorem Provers for Modal Logics – Introduction and Summary. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 25-26. Springer (1998).
Kahle, R.: Frege structures for partial applicative theories. Journal of Logic and Computation. 8, 683-700 (1998).