| 2013 | ||
|---|---|---|
| j45 | ||
| 2012 | ||
| j44 | Gerhard Jäger: Power Laws and Other heavy-Tailed Distributions in Linguistic Typology. Advances in Complex Systems 15(3-4) (2012) | |
| j43 | Michael Franke, Gerhard Jäger: Bidirectional Optimization from Reasoning and Learning in Games. Journal of Logic, Language and Information 21(1): 117-139 (2012) | |
| 2011 | ||
| j42 | Gerhard Jäger, Dieter Probst: The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. Ann. Pure Appl. Logic 162(8): 647-660 (2011) | |
| j41 | Gerhard Jäger, Lars P. Metzger, Frank Riedel: Voronoi languages: Equilibria in cheap-talk games with high-dimensional types and few signals. Games and Economic Behavior 73(2): 517-537 (2011) | |
| j40 | Gerhard Jäger, Thomas Studer: A Buchholz Rule for Modal Fixed Point Logics. Logica Universalis 5(1): 1-19 (2011) | |
| 2010 | ||
| c8 | Michael Franke, Gerhard Jäger, Robert van Rooij: Vagueness, Signaling and Bounded Rationality. JSAI-isAI Workshops 2010: 45-59 | |
| p1 | Gerhard Jäger: Modal Fixed Point Logics. Logics and Languages for Reliability and Security 2010: 129-154 | |
| e3 | Christian Ebert, Gerhard Jäger, Jens Michaelis (Eds.): The Mathematics of Language, 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007, and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers. Lecture Notes in Computer Science 6149, Springer 2010, isbn 978-3-642-14321-2 | |
| 2009 | ||
| j39 | Gerhard Jäger: Full operational set theory with unbounded existential quantification and power set. Ann. Pure Appl. Logic 160(1): 33-52 (2009) | |
| c7 | Gerhard Jäger: Natural Color Categories Are Convex Sets. Amsterdam Colloquium on Logic, Language and Meaning 2009: 11-20 | |
| 2008 | ||
| j38 | ||
| j37 | Gerhard Jäger, Mathis Kretz, Thomas Studer: Canonical completeness of infinitary mu. J. Log. Algebr. Program. 76(2): 270-292 (2008) | |
| 2007 | ||
| j36 | Gerhard Jäger: On Feferman's operational set theory OST. Ann. Pure Appl. Logic 150(1-3): 19-39 (2007) | |
| j35 | Gerhard Jäger, Mathis Kretz, Thomas Studer: Cut-free common knowledge. J. Applied Logic 5(4): 681-689 (2007) | |
| j34 | Gerhard Jäger, Robert van Rooij: Language structure: psychological and social constraints. Synthese 159(1): 99-130 (2007) | |
| 2005 | ||
| j33 | Luca Alberucci, Gerhard Jäger: About cut elimination for logics of common knowledge. Ann. Pure Appl. Logic 133(1-3): 73-99 (2005) | |
| j32 | Gerhard Jäger, Thomas Strahm: Reflections on reflections in explicit mathematics. Ann. Pure Appl. Logic 136(1-2): 116-133 (2005) | |
| j31 | Gerhard Jäger, Dieter Probst: Corrigendum to "Variation on a theme of Schütte". Math. Log. Q. 51(6): 642 (2005) | |
| 2004 | ||
| j30 | Gerhard Jäger: An intensional fixed point theory over first order arithmetic. Ann. Pure Appl. Logic 128(1-3): 197-213 (2004) | |
| j29 | Gerhard Jäger: Residuation, Structural Rules and Context Freeness. Journal of Logic, Language and Information 13(1): 47-59 (2004) | |
| j28 | ||
| 2003 | ||
| j27 | Gerhard Jäger: Recursion by optimization: on the complexity of bidirectional optimality theory. Natural Language Engineering 9(1): 21-38 (2003) | |
| 2002 | ||
| j26 | 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) | |
| j25 | 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 | ||
| j24 | Gerhard Jäger, Reinhard Kahle, Thomas Studer: Universes in explicit mathematics. Ann. Pure Appl. Logic 109(3): 141-162 (2001) | |
| j23 | Gerhard Jäger: Lambek Grammars as Combinatory Categorial Grammars. Logic Journal of the IGPL 9(6): 781-792 (2001) | |
| j22 | 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) | |
| j21 | Gerhard Jäger: First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo. J. Symb. Log. 66(3): 1073-1089 (2001) | |
| 2000 | ||
| j20 | Gerhard Jäger, Thomas Strahm: Fixed point theories and dependent choice. Arch. Math. Log. 39(7): 493-508 (2000) | |
| 1999 | ||
| j19 | Gerhard Jäger, Thomas Strahm: Bar Induction and omega Model Reflection. Ann. Pure Appl. Logic 97(1-3): 221-230 (1999) | |
| j18 | 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 | ||
| j17 | Gerhard Jäger, Wolfram Pohlers, Stanley S. Wainer: Editorial Logic Colloquium '95, Haifa, Israel. Arch. Math. Log. 37(5-6): 273 (1998) | |
| c6 | ||
| 1997 | ||
| j16 | ||
| 1996 | ||
| j15 | Alain Heuerding, Gerhard Jäger, Michael Schwendimann, Michael Seyfried: A Logics Workbench. AI Commun. 9(2): 53-58 (1996) | |
| j14 | Solomon Feferman, Gerhard Jäger: Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II. Ann. Pure Appl. Logic 79(1): 37-52 (1996) | |
| j13 | 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 | ||
| j12 | Gerhard Jäger, Thomas Strahm: Second order theories with ordinals and elementary comprehension. Arch. Math. Log. 34(6): 345-375 (1995) | |
| j11 | Gerhard Jäger, Thomas Strahm: Totality in Applicative Theories. Ann. Pure Appl. Logic 74(2): 105-120 (1995) | |
| j10 | 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) | |
| c5 | Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, Michael Seyfried: Propositional Logics on the Computer. TABLEAUX 1995: 310-323 | |
| 1994 | ||
| j9 | Brigitte Hösli, Gerhard Jäger: About Some Symmetries of Negation. J. Symb. Log. 59(2): 473-485 (1994) | |
| 1993 | ||
| j8 | Gerhard Jäger: Fixed Points in Peano Arithmetic with Ordinals. Ann. Pure Appl. Logic 60(2): 119-132 (1993) | |
| j7 | Solomon Feferman, Gerhard Jäger: Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I. Ann. Pure Appl. Logic 65(3): 243-263 (1993) | |
| j6 | 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) | |
| e2 | Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter (Eds.): Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers. Lecture Notes in Computer Science 702, Springer 1993, isbn 3-540-56992-8 | |
| 1992 | ||
| j5 | Gerhard Jäger, Barbara Primo: About the Proof-Theoretic Ordinals of Weak Fixed Point Theories. J. Symb. Log. 57(3): 1108-1119 (1992) | |
| e1 | Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter (Eds.): Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings. Lecture Notes in Computer Science 626, Springer 1992, isbn 3-540-55789-X | |
| 1990 | ||
| j4 | Gerhard Jäger: Annotations on the Consistency of the Closed World Assumption. J. Log. Program. 8(3): 229-247 (1990) | |
| c4 | ||
| 1989 | ||
| c3 | ||
| 1987 | ||
| c2 | ||
| 1986 | ||
| j3 | ||
| c1 | ||
| 1984 | ||
| j2 | Gerhard Jäger: The Strength of Admissibility Without Foundation. J. Symb. Log. 49(3): 867-879 (1984) | |
| 1983 | ||
| j1 | 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) | |
Colors in the list of coauthors
Last update Sun May 19 21:13:37 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page