Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen. - Gerhard Jäger 001 (Arch. Math. Log., 1980)

Beweistheorie vonKPN. - Gerhard Jäger 001 (Arch. Math. Log., 1980)

A well-ordering proof for Feferman's theoryT0. - Gerhard Jäger 001 (Arch. Math. Log., 1983)

Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis. - Solomon Feferman; Gerhard Jäger 001 (J. Symb. Log., 1983)

ϱ-inaccessible ordinals, collapsing functions and a recursive notation system. - Gerhard Jäger 001 (Arch. Math. Log., 1984)

The Strength of Admissibility Without Foundation. - Gerhard Jäger 001 (J. Symb. Log., 1984)

A Version of Kripke-Platek Set Theory which is Conservative over Peano Arithmetic. - Gerhard Jäger 001 (Math. Log. Q., 1984)

Some proof-theoretic contributions to theories of sets. - Gerhard Jäger 001 (Logic Colloquium, 1985)

Some Contributions to the Logical Analysis of Circumscrition. - Gerhard Jäger 001 (CADE, 1986)

A Boundedness Theorem In mathrmID1 (W). - Gerhard Jäger 001 (J. Symb. Log., 1986)

Countable Admissible Ordinals and Dilators. - Gerhard Jäger 001 (Math. Log. Q., 1986)

Induction in the Elementary Theory of Types and Names. - Gerhard Jäger 001 (CSL, 1987)

Proofs as Advanced and Powerful Tool. - Gerhard Jäger 001 (IFIP Congress, 1989)

Notions of Nonmonotonic Derivability. - Gerhard Jäger 001 (Nonmonotonic and Inductive Logic, 1990)

Annotations on the Consistency of the Closed World Assumption. - Gerhard Jäger 001 (J. Log. Program., 1990)

Between constructive mathematics and PROLOG. - Gerhard Jäger 001 (Arch. Math. Log., 1991)

About the Proof-Theoretic Ordinals of Weak Fixed Point Theories. - Gerhard Jäger 001; Barbara Primo (J. Symb. Log., 1992)

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I. - Solomon Feferman; Gerhard Jäger 001 (Ann. Pure Appl. Logic, 1993)

Fixed Points in Peano Arithmetic with Ordinals. - Gerhard Jäger 001 (Ann. Pure Appl. Log., 1993)

The Defining Power of Stratified and Hierarchical Logic Programs. - Gerhard Jäger 001; Robert F. Stärk (J. Log. Program., 1993)

About Some Symmetries of Negation. - Brigitte Hösli; Gerhard Jäger 001 (J. Symb. Log., 1994)

Propositional Logics on the Computer. - Alain Heuerding; Gerhard Jäger 001; Stefan Schwendimann; Michael Seyfried (TABLEAUX, 1995)

Second order theories with ordinals and elementary comprehension. - Gerhard Jäger 001; Thomas Strahm (Arch. Math. Log., 1995)

Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994. - Sergei N. Artëmov; George Boolos; Erwin Engeler; Solomon Feferman; Gerhard Jäger 001; Albert Visser (Ann. Pure Appl. Log., 1995)

Totality in Applicative Theories. - Gerhard Jäger 001; Thomas Strahm (Ann. Pure Appl. Log., 1995)

A Logics Workbench. - Alain Heuerding; Gerhard Jäger 001; Michael Schwendimann; Michael Seyfried (AI Commun., 1996)

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II. - Solomon Feferman; Gerhard Jäger 001 (Ann. Pure Appl. Log., 1996)

Some Theories with Positive Induction of Ordinal Strength phi omega 0. - Gerhard Jäger 001; Thomas Strahm (J. Symb. Log., 1996)

Power Types in Explicit Mathematics. - Gerhard Jäger 001 (J. Symb. Log., 1997)

Editorial Logic Colloquium '95, Haifa, Israel. - Gerhard Jäger 001; Wolfram Pohlers; Stanley S. Wainer (Arch. Math. Log., 1998)

Bar Induction and omega Model Reflection. - Gerhard Jäger 001; Thomas Strahm (Ann. Pure Appl. Log., 1999)

The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories. - Gerhard Jäger 001; Reinhard Kahle; Anton Setzer; Thomas Strahm (J. Symb. Log., 1999)

Fixed point theories and dependent choice. - Gerhard Jäger 001; Thomas Strahm (Arch. Math. Log., 2000)

Universes in explicit mathematics. - Gerhard Jäger 001; Reinhard Kahle; Thomas Studer (Ann. Pure Appl. Log., 2001)

First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo. - Gerhard Jäger 001 (J. Symb. Log., 2001)

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory. - Gerhard Jäger 001; Thomas Strahm (J. Symb. Log., 2001)

Extending the system T0 of explicit mathematics: the limit and Mahlo axioms. - Gerhard Jäger 001; Thomas Studer (Ann. Pure Appl. Log., 2002)

An intensional fixed point theory over first order arithmetic. - Gerhard Jäger 001 (Ann. Pure Appl. Log., 2004)

Variation on a theme of Schütte. - Gerhard Jäger 001; Dieter Probst (Math. Log. Q., 2004)

About cut elimination for logics of common knowledge. - Luca Alberucci; Gerhard Jäger 001 (Ann. Pure Appl. Log., 2005)

Reflections on reflections in explicit mathematics. - Gerhard Jäger 001; Thomas Strahm (Ann. Pure Appl. Log., 2005)

Corrigendum to "Variation on a theme of Schütte". - Gerhard Jäger 001; Dieter Probst (Math. Log. Q., 2005)

On Feferman's operational set theory OST. - Gerhard Jäger 001 (Ann. Pure Appl. Log., 2007)

Cut-free common knowledge. - Gerhard Jäger 001; Mathis Kretz; Thomas Studer (J. Appl. Log., 2007)

Preface. - Vasco Brattka; Gerhard Jäger 001; Hans-Peter A. Künzi (J. Log. Algebraic Methods Program., 2008)

Canonical completeness of infinitary mu. - Gerhard Jäger 001; Mathis Kretz; Thomas Studer (J. Log. Algebraic Methods Program., 2008)

Full operational set theory with unbounded existential quantification and power set. - Gerhard Jäger 001 (Ann. Pure Appl. Log., 2009)

Modal Fixed Point Logics. - Gerhard Jäger 001 (Logics and Languages for Reliability and Security, 2010)

The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. - Gerhard Jäger 001; Dieter Probst (Ann. Pure Appl. Log., 2011)

A Buchholz Rule for Modal Fixed Point Logics. - Gerhard Jäger 001; Thomas Studer (Logica Universalis, 2011)

Operational closure and stability. - Gerhard Jäger 001 (Ann. Pure Appl. Log., 2013)

Explicit Mathematics and Operational Set Theory: some Ontological comparisons. - Gerhard Jäger 001; Rico Zumbrunnen (Bull. Symb. Log., 2014)

A canonical model construction for intuitionistic distributed knowledge. - Gerhard Jäger 001; Michel Marti (Advances in Modal Logic, 2016)

Relativizing Operational Set Theory. - Gerhard Jäger 001 (Bull. Symb. Log., 2016)

Intuitionistic common knowledge or belief. - Gerhard Jäger 001; Michel Marti (J. Appl. Log., 2016)

Truncation and Semi-Decidability Notions in Applicative Theories. - Gerhard Jäger 001; Timotej Rosebrock; Sato Kentaro (J. Symb. Log., 2018)

About some fixed Point Axioms and Related Principles in Kripke-Platek Environments. - Gerhard Jäger 001; Silvia Steila (J. Symb. Log., 2018)

An Infinitary Treatment of Full Mu-Calculus. - Bahareh Afshari; Gerhard Jäger 001; Graham E. Leigh (WoLLIC, 2019)

Short note: Least fixed points versus least closed points. - Gerhard Jäger 001 (Arch. Math. Log., 2021)

Admissible extensions of subtheories of second order arithmetic. - Gerhard Jäger 001; Michael Rathjen (Ann. Pure Appl. Log., 2024)

Tame and full strict-Π11 reflection: A proof-theoretic approach. - Gerhard Jäger 001 (J. Log. Comput., 2024)