# Publications

Export 59 results:
Filters: Author is Gerhard Jäger  [Clear All Filters]
2005
: Cut-free axiomatizations for stratified modal fixed point logic. In: Schlingloff, H. Proceedings of Methods for Modalities 4. pp. 125-143. Humboldt-Universität Berlin (2005).
Jäger, G.: Metapredicative and explicit Mahlo: a proof-theoretic perspective. In: Proceedings of Logic Colloquium '00. pp. 272-293. AK Peters (2005).
: Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic. 136, 116-133 (2005).
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).
: Variation on a theme of Schütte. Mathematical Logic Quarterly. 50, 258-264 (2004).
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).
: 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).
2001
Jäger, G.: First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo. The Journal of Symbolic Logic. 66, 1073-1089 (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
: Fixed point theories and dependent choice. Archive for Mathematical Logic. 39, 493-508 (2000).
1999
: Bar induction and $\omega$ model reflection. Annals of Pure and Applied Logic. 97, 221-230 (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
: A proof-theoretic framework for logic programming. In: Buss, S.S. Handbook of Proof Theory. pp. 639-682. North-Holland (1998).
1997
Jäger, G.: Power types in explicit mathematics?. The Journal of Symbolic Logic. 62, 1142-1146 (1997).
Jäger, G.: Some proof theory of first order logic programming. In: Schwichtenberg, H. Logic of Computation. pp. 201-228. Springer (1997).
1996
: A logics workbench. The European Journal on Artificial Intelligence. 9, 53-58 (1996).
: Some theories with positive induction of ordinal strength $\varphi \omega 0$. The Journal of Symbolic Logic. 61, 818-842 (1996).
: Systems of explicit mathematics with non-constructive $μ$-operator. Part II. Annals of Pure and Applied Logic. 79, 37-52 (1996).
: The logics workbench LWB: a snapshot. Euromath Bulletin. 2, 177-186 (1996).
1995
Jäger, G.: A deductive approach to logic programming. In: Schwichtenberg, H. Proof and Computation. pp. 231-270. Springer (1995).
: LWB - a logics workbench, extended abstract. In: Proceedings of KI-95 Activities: Workshop, Posters, Demos. pp. 73-74. Gesellschaft für Informatik (1995).
: Propositional logics on the computer. In: Proceedings of Theorem Proving with Analytic Tableaux and Related Methods. pp. 310-323. Springer (1995).