2008 |
44 | EE | Gerhard Jäger,
Mathis Kretz,
Thomas Studer:
Canonical completeness of infinitary mu.
J. Log. Algebr. Program. 76(2): 270-292 (2008) |
43 | EE | Vasco Brattka,
Gerhard Jäger,
Hans-Peter A. Künzi:
Preface.
J. Log. Algebr. Program. 76(2): (2008) |
2007 |
42 | EE | Gerhard Jäger:
On Feferman's operational set theory OST.
Ann. Pure Appl. Logic 150(1-3): 19-39 (2007) |
41 | EE | Gerhard Jäger,
Mathis Kretz,
Thomas Studer:
Cut-free common knowledge.
J. Applied Logic 5(4): 681-689 (2007) |
40 | EE | Gerhard Jäger,
Robert van Rooij:
Language structure: psychological and social constraints.
Synthese 159(1): 99-130 (2007) |
2005 |
39 | EE | Luca Alberucci,
Gerhard Jäger:
About cut elimination for logics of common knowledge.
Ann. Pure Appl. Logic 133(1-3): 73-99 (2005) |
38 | EE | Gerhard Jäger,
Thomas Strahm:
Reflections on reflections in explicit mathematics.
Ann. Pure Appl. Logic 136(1-2): 116-133 (2005) |
37 | EE | Gerhard Jäger,
Dieter Probst:
Corrigendum to "Variation on a theme of Schütte".
Math. Log. Q. 51(6): 642 (2005) |
2004 |
36 | EE | Gerhard Jäger:
An intensional fixed point theory over first order arithmetic.
Ann. Pure Appl. Logic 128(1-3): 197-213 (2004) |
35 | EE | Gerhard Jäger:
Residuation, Structural Rules and Context Freeness.
Journal of Logic, Language and Information 13(1): 47-59 (2004) |
34 | EE | Gerhard Jäger,
Dieter Probst:
Variation on a theme of Schütte.
Math. Log. Q. 50(3): 258-264 (2004) |
2002 |
33 | | Gerhard Jäger,
Thomas Studer:
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms.
Ann. Pure Appl. Logic 114(1-3): 79-101 (2002) |
32 | | Gerhard Jäger:
Some Notes on the Formal Properties of Bidirectional Optimality Theory.
Journal of Logic, Language and Information 11(4): 427-451 (2002) |
2001 |
31 | | Gerhard Jäger,
Reinhard Kahle,
Thomas Studer:
Universes in explicit mathematics.
Ann. Pure Appl. Logic 109(3): 141-162 (2001) |
30 | | Gerhard Jäger,
Thomas Strahm:
Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.
J. Symb. Log. 66(2): 935-958 (2001) |
29 | | Gerhard Jäger:
First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo.
J. Symb. Log. 66(3): 1073-1089 (2001) |
28 | EE | Gerhard Jäger:
Lambek Grammars as Combinatory Categorial Grammars.
Logic Journal of the IGPL 9(6): (2001) |
2000 |
27 | EE | Gerhard Jäger,
Thomas Strahm:
Fixed point theories and dependent choice.
Arch. Math. Log. 39(7): 493-508 (2000) |
1999 |
26 | | Gerhard Jäger,
Thomas Strahm:
Bar Induction and omega Model Reflection.
Ann. Pure Appl. Logic 97(1-3): 221-230 (1999) |
25 | | Gerhard Jäger,
Reinhard Kahle,
Anton Setzer,
Thomas Strahm:
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.
J. Symb. Log. 64(1): 53-67 (1999) |
1998 |
24 | EE | Gerhard Jäger:
Anaphora and Quantification in Categorial Grammar.
LACL 1998: 70-89 |
23 | EE | Gerhard Jäger,
Wolfram Pohlers,
Stanley S. Wainer:
Editorial Logic Colloquium '95, Haifa, Israel.
Arch. Math. Log. 37(5-6): 273 (1998) |
1997 |
22 | | Gerhard Jäger:
Power Types in Explicit Mathematics.
J. Symb. Log. 62(4): 1142-1146 (1997) |
1996 |
21 | | Alain Heuerding,
Gerhard Jäger,
Michael Schwendimann,
Michael Seyfried:
A Logics Workbench.
AI Commun. 9(2): 53-58 (1996) |
20 | | Solomon Feferman,
Gerhard Jäger:
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II.
Ann. Pure Appl. Logic 79(1): 37-52 (1996) |
19 | | Gerhard Jäger,
Thomas Strahm:
Some Theories with Positive Induction of Ordinal Strength phi omega 0.
J. Symb. Log. 61(3): 818-842 (1996) |
1995 |
18 | | Alain Heuerding,
Gerhard Jäger,
Stefan Schwendimann,
Michael Seyfried:
Propositional Logics on the Computer.
TABLEAUX 1995: 310-323 |
17 | | Gerhard Jäger,
Thomas Strahm:
Totality in Applicative Theories.
Ann. Pure Appl. Logic 74(2): 105-120 (1995) |
16 | | Sergei N. Artëmov,
George Boolos,
Erwin Engeler,
Solomon Feferman,
Gerhard Jäger,
Albert Visser:
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994.
Ann. Pure Appl. Logic 75(1-2): 1 (1995) |
1994 |
15 | | Brigitte Hösli,
Gerhard Jäger:
About Some Symmetries of Negation.
J. Symb. Log. 59(2): 473-485 (1994) |
1993 |
14 | | Egon Börger,
Gerhard Jäger,
Hans Kleine Büning,
Simone Martini,
Michael M. Richter:
Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers
Springer 1993 |
13 | | Gerhard Jäger:
Fixed Points in Peano Arithmetic with Ordinals.
Ann. Pure Appl. Logic 60(2): 119-132 (1993) |
12 | | Solomon Feferman,
Gerhard Jäger:
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I.
Ann. Pure Appl. Logic 65(3): 243-263 (1993) |
11 | | Gerhard Jäger,
Robert F. Stärk:
The Defining Power of Stratified and Hierarchical Logic Programs.
J. Log. Program. 15(1&2): 55-77 (1993) |
1992 |
10 | | Egon Börger,
Gerhard Jäger,
Hans Kleine Büning,
Michael M. Richter:
Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings
Springer 1992 |
9 | | Gerhard Jäger,
Barbara Primo:
About the Proof-Theoretic Ordinals of Weak Fixed Point Theories.
J. Symb. Log. 57(3): 1108-1119 (1992) |
1990 |
8 | | Gerhard Jäger:
Notions of Nonmonotonic Derivability.
Nonmonotonic and Inductive Logic 1990: 74-84 |
7 | | Gerhard Jäger:
Annotations on the Consistency of the Closed World Assumption.
J. Log. Program. 8(3): 229-247 (1990) |
1989 |
6 | | Gerhard Jäger:
Proofs as Advanced and Powerful Tool.
IFIP Congress 1989: 783-790 |
1987 |
5 | | Gerhard Jäger:
Induction in the Elementary Theory of Types and Names.
CSL 1987: 118-128 |
1986 |
4 | | Gerhard Jäger:
Some Contributions to the Logical Analysis of Circumscrition.
CADE 1986: 154-171 |
3 | | Gerhard Jäger:
A Boundedness Theorem In mathrmID1 (W).
J. Symb. Log. 51(4): 942-947 (1986) |
1984 |
2 | | Gerhard Jäger:
The Strength of Admissibility Without Foundation.
J. Symb. Log. 49(3): 867-879 (1984) |
1983 |
1 | | Solomon Feferman,
Gerhard Jäger:
Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis.
J. Symb. Log. 48(1): 63-70 (1983) |