Export 60 results:
Filters: Author is Gerhard Jäger  [Clear All Filters]
Jäger, G.: An intensional fixed point theory over first order arithmetic. Annals of Pure and Applied Logic. 128, 197-213 (2004).
Jäger, G., Probst, D.: 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).
Jäger, G., Probst, D.: Variation on a theme of Schütte. Mathematical Logic Quarterly. 50, 258-264 (2004).
Jäger, G., Studer, T.: Extending the system $\mathsf{T}_0$ of explicit mathematics: the limit and Mahlo axioms. Annals of Pure and Applied Logic. 114, 79-101 (2002).
Jäger, G., Strahm, T.: The proof-theoretic analysis of the Suslin operator in applicative theories. In: Sieg, W., Sommer, R., and Talcott, C. Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman. pp. 270-292. AK Peters (2002).
Jäger, G., Strahm, T.: Fixed point theories and dependent choice. Archive for Mathematical Logic. 39, 493-508 (2000).
Jäger, G., Stärk, R.F.: A proof-theoretic framework for logic programming. In: Buss, S.S. Handbook of Proof Theory. pp. 639-682. North-Holland (1998).
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).
Jäger, G.: A deductive approach to logic programming. In: Schwichtenberg, H. Proof and Computation. pp. 231-270. Springer (1995).
Heuerding, A., Jäger, G., Schwendimann, S., Seyfried, M.: LWB - a logics workbench, extended abstract. In: Dreschler-Fischer, L. and Pribbenow, S. Proceedings of KI-95 Activities: Workshop, Posters, Demos. pp. 73-74. Gesellschaft für Informatik (1995).