Gerhard Jäger

According to our database, Gerhard Jäger authored at least 61 papers between 1980 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Tame and full strict-<i>Π</i>11 reflection: A proof-theoretic approach.

Gerhard Jäger

J. Log. Comput., 2024

Admissible extensions of subtheories of second order arithmetic.

Gerhard Jäger, Michael Rathjen

Ann. Pure Appl. Log., 2024

2021

Short note: Least fixed points versus least closed points.

Gerhard Jäger

Arch. Math. Log., 2021

2019

An Infinitary Treatment of Full Mu-Calculus.

Bahareh Afshari, Gerhard Jäger, Graham E. Leigh

Proceedings of the Logic, Language, Information, and Computation, 2019

2018

About some fixed Point Axioms and Related Principles in Kripke-Platek Environments.

Gerhard Jäger, Silvia Steila

J. Symb. Log., 2018

Truncation and Semi-Decidability Notions in Applicative Theories.

Gerhard Jäger, Timotej Rosebrock, Sato Kentaro

J. Symb. Log., 2018

2016

Intuitionistic common knowledge or belief.

Gerhard Jäger, Michel Marti

J. Appl. Log., 2016

Relativizing Operational Set Theory.

Gerhard Jäger

Bull. Symb. Log., 2016

A canonical model construction for intuitionistic distributed knowledge.

Gerhard Jäger, Michel Marti

Proceedings of the Advances in Modal Logic 11, 2016

2014

Explicit Mathematics and Operational Set Theory: some Ontological comparisons.

Gerhard Jäger, Rico Zumbrunnen

Bull. Symb. Log., 2014

2013

Operational closure and stability.

Gerhard Jäger

Ann. Pure Appl. Log., 2013

2011

A Buchholz Rule for Modal Fixed Point Logics.

Gerhard Jäger, Thomas Studer

Logica Universalis, 2011

The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories.

Gerhard Jäger, Dieter Probst

Ann. Pure Appl. Log., 2011

2010

Modal Fixed Point Logics.

Gerhard Jäger

Proceedings of the Logics and Languages for Reliability and Security, 2010

2009

Full operational set theory with unbounded existential quantification and power set.

Gerhard Jäger

Ann. Pure Appl. Log., 2009

2008

Canonical completeness of infinitary mu.

Gerhard Jäger, Mathis Kretz, Thomas Studer

J. Log. Algebraic Methods Program., 2008

Preface.

Vasco Brattka, Gerhard Jäger, Hans-Peter A. Künzi

J. Log. Algebraic Methods Program., 2008

2007

Cut-free common knowledge.

Gerhard Jäger, Mathis Kretz, Thomas Studer

J. Appl. Log., 2007

On Feferman's operational set theory OST.

Gerhard Jäger

Ann. Pure Appl. Log., 2007

2005

Corrigendum to "Variation on a theme of Schütte".

Gerhard Jäger, Dieter Probst

Math. Log. Q., 2005

Reflections on reflections in explicit mathematics.

Gerhard Jäger, Thomas Strahm

Ann. Pure Appl. Log., 2005

About cut elimination for logics of common knowledge.

Luca Alberucci, Gerhard Jäger

Ann. Pure Appl. Log., 2005

2004

Variation on a theme of Schütte.

Gerhard Jäger, Dieter Probst

Math. Log. Q., 2004

An intensional fixed point theory over first order arithmetic.

Gerhard Jäger

Ann. Pure Appl. Log., 2004

2002

Extending the system T₀ of explicit mathematics: the limit and Mahlo axioms.

Gerhard Jäger, Thomas Studer

Ann. Pure Appl. Log., 2002

2001

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.

Gerhard Jäger, Thomas Strahm

J. Symb. Log., 2001

First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo.

Gerhard Jäger

J. Symb. Log., 2001

Universes in explicit mathematics.

Gerhard Jäger, Reinhard Kahle, Thomas Studer

Ann. Pure Appl. Log., 2001

2000

Fixed point theories and dependent choice.

Gerhard Jäger, Thomas Strahm

Arch. Math. Log., 2000

1999

The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.

Gerhard Jäger, Reinhard Kahle, Anton Setzer, Thomas Strahm

J. Symb. Log., 1999

Bar Induction and omega Model Reflection.

Gerhard Jäger, Thomas Strahm

Ann. Pure Appl. Log., 1999

1998

Editorial Logic Colloquium '95, Haifa, Israel.

Gerhard Jäger, Wolfram Pohlers, Stanley S. Wainer

Arch. Math. Log., 1998

1997

Power Types in Explicit Mathematics.

Gerhard Jäger

J. Symb. Log., 1997

1996

Some Theories with Positive Induction of Ordinal Strength <i>phi omega 0</i>.

Gerhard Jäger, Thomas Strahm

J. Symb. Log., 1996

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II.

Solomon Feferman, Gerhard Jäger

Ann. Pure Appl. Log., 1996

A Logics Workbench.

Alain Heuerding, Gerhard Jäger, Michael Schwendimann, Michael Seyfried

AI Commun., 1996

1995

Totality in Applicative Theories.

Gerhard Jäger, Thomas Strahm

Ann. Pure Appl. 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, Albert Visser

Ann. Pure Appl. Log., 1995

Second order theories with ordinals and elementary comprehension.

Gerhard Jäger, Thomas Strahm

Arch. Math. Log., 1995

Propositional Logics on the Computer.

Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, Michael Seyfried

Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

1994

About Some Symmetries of Negation.

Brigitte Hösli, Gerhard Jäger

J. Symb. Log., 1994

1993

The Defining Power of Stratified and Hierarchical Logic Programs.

Gerhard Jäger, Robert F. Stärk

J. Log. Program., 1993

Fixed Points in Peano Arithmetic with Ordinals.

Gerhard Jäger

Ann. Pure Appl. Log., 1993

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I.

Solomon Feferman, Gerhard Jäger

Ann. Pure Appl. Logic, 1993

1992

About the Proof-Theoretic Ordinals of Weak Fixed Point Theories.

Gerhard Jäger, Barbara Primo

J. Symb. Log., 1992

1991

Between constructive mathematics and PROLOG.

Gerhard Jäger

Arch. Math. Log., 1991

1990

Annotations on the Consistency of the Closed World Assumption.

Gerhard Jäger

J. Log. Program., 1990

Notions of Nonmonotonic Derivability.

Gerhard Jäger

Proceedings of the Nonmonotonic and Inductive Logic, 1990

1989

Proofs as Advanced and Powerful Tool.

Gerhard Jäger

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1987

Induction in the Elementary Theory of Types and Names.

Gerhard Jäger

Proceedings of the CSL '87, 1987

1986

Countable Admissible Ordinals and Dilators.

Gerhard Jäger

Math. Log. Q., 1986

A Boundedness Theorem In mathrmID1 (W).

Gerhard Jäger

J. Symb. Log., 1986

Some Contributions to the Logical Analysis of Circumscrition.

Gerhard Jäger

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985

Some proof-theoretic contributions to theories of sets.

Gerhard Jäger

Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1984

A Version of Kripke-Platek Set Theory which is Conservative over Peano Arithmetic.

Gerhard Jäger

Math. Log. Q., 1984

The Strength of Admissibility Without Foundation.

Gerhard Jäger

J. Symb. Log., 1984

<i>ϱ</i>-inaccessible ordinals, collapsing functions and a recursive notation system.

Gerhard Jäger

Arch. Math. Log., 1984

1983

Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis.

Solomon Feferman, Gerhard Jäger

J. Symb. Log., 1983

A well-ordering proof for Feferman's theory<i>T</i>₀.

Gerhard Jäger

Arch. Math. Log., 1983

1980

Beweistheorie von<i>KPN</i>.

Gerhard Jäger

Arch. Math. Log., 1980

Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen.

Gerhard Jäger

Arch. Math. Log., 1980