| [Jäg18] | Gerhard Jäger. The Operational Penumbra: Some Ontological Aspects, volume 13. Springer International Publishing, 2018. [ bib | .pdf ] |
| [JM16b] | Gerhard Jäger and Michel Marti. Intuitionistic common knowledge or belief. Journal of applied logic, 2016. [ bib | .pdf ] |
| [BJS16] | Ulrik Torben Buchholtz, Gerhard Jäger, and Thomas Adrian Strahm. Theories of proof-theoretic strength ψ(Γ?+1). In Dieter Probst and Peter Schuster, editors, Concepts of Proof in Mathematics, Philosophy, and ComputerScience, volume 6 of Ontos Mathematical Logic. De Gruyter, January 2016. [ bib | .pdf ] |
| [Jäg16] | Gerhard Jäger. Relativizing operational set theory. The Bulletin of Symbolic Logic, 2016. [ bib | .pdf ] |
| [JM16a] | Gerhard Jäger and Michel Marti. A canonical model construction for intuitionistic distributed knowledge. In Advances in Modal Logic 2016. College Publications, College Publications, 2016. [ bib | .pdf ] |
| [JZ14] | Gerhard Jäger and Rico Zumbrunnen. Explicit mathematics and operational set theory: some ontological comparisons. The Bulletin of Symbolic Logic, 20:275--292, September 2014. [ bib | DOI | .pdf ] |
| [Jäg13] | Gerhard Jäger. Operational closure and stability. Annals of Pure and Applied Logic, 164(7–8):813 -- 821, 2013. [ bib | DOI | .pdf ] |
| [JZ12] | Gerhard Jäger and Rico Zumbrunnen. About the Strength of Operational Regularity. In Ulrich Berger, Hannes Diener, Peter Schuster, and Monika Seisenberger, editors, Logic, Construction, Computation, pages 305--324. Ontos Verlag, 2012. [ bib | .pdf ] |
| [JP11] | Gerhard Jäger and Dieter Probst. The suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. Annals of Pure and Applied Logic, 162(8):647--660, 2011. [ bib | DOI | .pdf ] |
| [JS11] | Gerhard Jäger and Thomas Studer. A Buchholz rule for modal fixed point logics. Logica Universalis, 5(1):1--19, 2011. [ bib | DOI | .pdf ] |
| [JK10] | Gerhard Jäger and Jürg Krähenbühl. Σ11 choice in a theory of sets and classes. In Ralf Schindler, editor, Ways of Proof Theory, pages 283--314. Ontos Verlag, 2010. [ bib | .pdf ] |
| [Jäg10] | Gerhard Jäger. Modal Fixed Point Logics. In J. Esparza, B. Spanfelner, and O. Grumberg, editors, Logics and Languages for Reliability and Security, volume 25 of NATO Science for Peace and Security Series - D: Information and Communication Security. IOS Press, 2010. [ bib | DOI | .pdf ] |
| [Jäg09a] | Gerhard Jäger. Full operational set theory with unbounded existential quantification and power set. Annals of Pure and Applied Logic, 160(1):33--52, July 2009. [ bib | .pdf ] |
| [Jäg09b] | Gerhard Jäger. Operations, sets and classes. In C. Glymour, W. Wei, and D. Westerstahl, editors, Logic, Methodology and Philosophy of Science - Proceedings of the Thirteenth International Congress. College Publications, 2009. [ bib | .pdf ] |
| [JKS08] | Gerhard Jäger, Mathis Kretz, and Thomas Studer. Canonical completeness of infinitary mu. Journal of Logic and Algebraic Programming, 76(2):270--292, 2008. [ bib | DOI | .pdf ] |
| [JKS07] | Gerhard Jäger, Mathis Kretz, and Thomas Studer. Cut-free common knowledge. Journal of Applied Logic, 5(4):681--689, 2007. [ bib | DOI | .pdf ] |
| [Jäg07] | Gerhard Jäger. On Feferman's operational set theory OST. Annals of Pure and Applied Logic, 150(1--3):19--39, 2007. [ bib | .pdf ] |
| [Jäg05] | Gerhard Jäger. Metapredicative and explicit Mahlo: a proof-theoretic perspective. In Rene Cori, Alexander Razborov, Stevo Todorcevic, and Carol Wood, editors, Proceedings of Logic Colloquium '00, volume 19 of Association of Symbolic Logic Lecture Notes in Logic, pages 272--293. AK Peters, 2005. [ bib | .pdf ] |
| [JKS05] | Gerhard Jäger, Mathis Kretz, and Thomas Studer. Cut-free axiomatizations for stratified modal fixed point logic. In Holger Schlingloff, editor, Proceedings of Methods for Modalities 4, volume 194 of Humboldt-Universität Berlin Informatik-Berichte, pages 125--143. Humboldt-Universität Berlin, 2005. [ bib | .pdf ] |
| [JS05] | Gerhard Jäger and Thomas Strahm. Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic, 136(1--2):116--133, 2005. [ bib | .pdf ] |
| [AJ05] | Luca Alberucci and Gerhard Jäger. About cut elimination for logics of common knowledge. Annals of Pure and Applied Logic, 133(1--3):73--99, 2005. [ bib | DOI | .pdf ] |
| [JP04b] | Gerhard Jäger and Dieter Probst. Variation on a theme of Schütte. Mathematical Logic Quarterly, 50(3):258--264, 2004. [ bib | .pdf ] |
| [Jäg04] | Gerhard Jäger. An intensional fixed point theory over first order arithmetic. Annals of Pure and Applied Logic, 128(1--3):197--213, 2004. [ bib | .pdf ] |
| [JP04a] | Gerhard Jäger and Dieter Probst. Iterating Σ operations in admissible set theory without foundation: a further aspect of metapredicative Mahlo. In Godehart Link, editor, One Hundred Years of Russell's Paradox. Papers from the 2001 Munich Russell Conference, pages 119--134. de Gruyter, 2004. [ bib | .pdf ] |
| [JS02a] | Gerhard Jäger and Thomas Strahm. The proof-theoretic analysis of the Suslin operator in applicative theories. In Wilfried Sieg, Richard Sommer, and Carolyn Talcott, editors, Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, pages 270--292. AK Peters, 2002. [ bib | .pdf ] |
| [JS02b] | Gerhard Jäger and Thomas Studer. Extending the system T0 of explicit mathematics: the limit and Mahlo axioms. Annals of Pure and Applied Logic, 114(1--3):79--101, 2002. [ bib | .pdf ] |
| [JS01] | Gerhard Jäger and Thomas Strahm. Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory. The Journal of Symbolic Logic, 66(2):935--958, 2001. [ bib | .pdf ] |
| [Jäg01] | Gerhard Jäger. First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo. The Journal of Symbolic Logic, 66(3):1073--1089, 2001. [ bib | .pdf ] |
| [JKS01] | Gerhard Jäger, Reinhard Kahle, and Thomas Studer. Universes in explicit mathematics. Annals of Pure and Applied Logic, 109(3):141--162, 2001. [ bib | .pdf ] |
| [JS00] | Gerhard Jäger and Thomas Strahm. Fixed point theories and dependent choice. Archive for Mathematical Logic, 39(7):493--508, 2000. [ bib | .ps ] |
| [JS99] | Gerhard Jäger and Thomas Strahm. Bar induction and ω model reflection. Annals of Pure and Applied Logic, 97(1--3):221--230, 1999. [ bib | .ps ] |
| [JKSS99] | Gerhard Jäger, Reinhard Kahle, Anton Setzer, and Thomas Strahm. The proof-theoretic analysis of transfinitely iterated fixed point theories. The Journal of Symbolic Logic, 64(1):53--67, 1999. [ bib | .ps ] |
| [JKS99] | Gerhard Jäger, Reinhard Kahle, and Thomas Strahm. On applicative theories. In Andrea Cantini, Ettore Casari, and Pierluigi Minari, editors, Logic and Foundations of Mathematics, pages 83--92. Kluwer, 1999. [ bib | .ps ] |
| [JS98] | Gerhard Jäger and Robert F. Stärk. A proof-theoretic framework for logic programming. In Samuel S. Buss, editor, Handbook of Proof Theory, pages 639--682. North-Holland, 1998. [ bib | DOI | http ] |
| [Jäg97a] | Gerhard Jäger. Power types in explicit mathematics? The Journal of Symbolic Logic, 62(4):1142--1146, 1997. [ bib | http ] |
| [Jäg97b] | Gerhard Jäger. Some proof theory of first order logic programming. In Helmut Schwichtenberg, editor, Logic of Computation, volume 157 of NATO Science Series, pages 201--228. Springer, 1997. [ bib ] |
| [HJSS96b] | Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, and Michael Seyfried. The logics workbench LWB: a snapshot. Euromath Bulletin, 2(1):177--186, 1996. [ bib | .ps ] |
| [HJSS96a] | Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, and Michael Seyfried. A logics workbench. The European Journal on Artificial Intelligence, 9(2):53--58, 1996. [ bib ] |
| [FJ96] | Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive μ-operator. Part II. Annals of Pure and Applied Logic, 79(1):37--52, 1996. [ bib | DOI | http ] |
| [JS96] | Gerhard Jäger and Thomas Strahm. Some theories with positive induction of ordinal strength φ ω0. The Journal of Symbolic Logic, 61(3):818--842, 1996. [ bib | .ps ] |
| [HJSS95a] | Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, and Michael Seyfried. LWB - a logics workbench, extended abstract. In L. Dreschler-Fischer and S. Pribbenow, editors, Proceedings of KI-95 Activities: Workshop, Posters, Demos, pages 73--74. Gesellschaft für Informatik, 1995. [ bib ] |
| [JS95b] | Gerhard Jäger and Thomas Strahm. Totality in applicative theories. Annals of Pure and Applied Logic, 74(2):105--120, 1995. [ bib | .ps ] |
| [Jäg95] | Gerhard Jäger. A deductive approach to logic programming. In Helmut Schwichtenberg, editor, Proof and Computation, volume 139 of NATO ASI Series F, pages 231--270. Springer, 1995. [ bib ] |
| [JS95a] | Gerhard Jäger and Thomas Strahm. Second order theories with ordinals and elementary comprehension. Archive for Mathematical Logic, 34(6):345--375, 1995. [ bib | .ps ] |
| [HJSS95b] | Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, and Michael Seyfried. Propositional logics on the computer. In Peter Baumgartner, Reiner Hähnle, and Joachim Posegga, editors, Proceedings of Theorem Proving with Analytic Tableaux and Related Methods, volume 918 of Lecture Notes in Computer Science, pages 310--323. Springer, 1995. [ bib | .ps ] |
| [BEJ+94] | B. Bütler, R. Esser, Gerhard Jäger, Urs-Martin Künzi, Heinz Lienhard, and R. Mattmann. Executable models for analysis and implementation of complex systems. In Proceedings of Information Conference of Swiss Priority Programme Informatics Research 1992--1996, Module 1: Secure Distributed Systems, 1994. [ bib ] |
| [HJ94] | Brigitte Hösli and Gerhard Jäger. About some symmetries of negation. The Journal of Symbolic Logic, 59(2):473--485, 1994. [ bib | http ] |
| [Jäg93a] | Gerhard Jäger. Fixed points in Peano arithmetic with ordinals. Annals of Pure and Applied Logic, 60(2):119--132, 1993. [ bib | DOI | http ] |
| [JS93] | Gerhard Jäger and Robert F. Stärk. The defining power of stratified and hierarchical logic programs. Journal of Logic Programming, 15(1--2):55--77, 1993. [ bib | .pdf ] |
| [FJ93] | Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive μ-operator. Part I. Annals of Pure and Applied Logic, 65(3):243--263, 1993. [ bib | .pdf ] |
| [Jäg93b] | Gerhard Jäger. Some proof-theoretic aspects of logic programming. In Friedrich Ludwig Bauer, Wilfried Brauer, and Helmut Schwichtenberg, editors, Logic and Algebra of Specification, volume 94 of Computer and Systems Sciences, pages 113--142. Springer, 1993. [ bib ] |
This file was generated by bibtex2html 1.99.