Gerhard Jäger

Orcid: 0000-0002-9642-9359

Affiliations:
  • University of Bern, Switzerland


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Are Sounds Sound for Phylogenetic Reconstruction?
CoRR, 2024

2021
Phylogenetic typology.
CoRR, 2021

Short note: Least fixed points versus least closed points.
Arch. Math. Log., 2021

2020
NorthEuraLex: a wide-coverage lexical database of Northern Eurasia.
Lang. Resour. Evaluation, 2020

2019
An Infinitary Treatment of Full Mu-Calculus.
Proceedings of the Logic, Language, Information, and Computation, 2019

2018
About some fixed Point Axioms and Related Principles in Kripke-Platek Environments.
J. Symb. Log., 2018

Truncation and Semi-Decidability Notions in Applicative Theories.
J. Symb. Log., 2018

Computational Historical Linguistics.
CoRR, 2018

Global-scale phylogenetic linguistic inference from lexical resources.
CoRR, 2018

Are Automatic Methods for Cognate Detection Good Enough for Phylogenetic Reconstruction in Historical Linguistics?
Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2018

2017
Fast and unsupervised methods for multilingual cognate clustering.
CoRR, 2017

Using support vector machines and state-of-the-art algorithms for phonetic alignment to identify cognates in multi-lingual wordlists.
Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, 2017

2016
Intuitionistic common knowledge or belief.
J. Appl. Log., 2016

Relativizing Operational Set Theory.
Bull. Symb. Log., 2016

Automatic cognate classification with a Support Vector Machine.
Proceedings of the 13th Conference on Natural Language Processing, 2016

A canonical model construction for intuitionistic distributed knowledge.
Proceedings of the Advances in Modal Logic 11, 2016

2014
Explicit Mathematics and Operational Set Theory: some Ontological comparisons.
Bull. Symb. Log., 2014

2013
Operational closure and stability.
Ann. Pure Appl. Log., 2013

Cost-Based Pragmatic Inference about Referential Expressions.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

2012
Using Statistics for Cross-linguistic Semantics: A Quantitative Investigation of the Typology of Colour Naming Systems.
J. Semant., 2012

Bidirectional Optimization from Reasoning and Learning in Games.
J. Log. Lang. Inf., 2012

Power Laws and Other heavy-Tailed Distributions in Linguistic Typology.
Adv. Complex Syst., 2012

2011
Language, Games, and Evolution: An Introduction.
Proceedings of the Language, Games, and Evolution, 2011

A Buchholz Rule for Modal Fixed Point Logics.
Logica Universalis, 2011

Voronoi languages: Equilibria in cheap-talk games with high-dimensional types and few signals.
Games Econ. Behav., 2011

The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories.
Ann. Pure Appl. Log., 2011

Investigating the effects of prestige on the diffusion of linguistic variants.
Proceedings of the 33th Annual Meeting of the Cognitive Science Society, 2011

2010
Modal Fixed Point Logics.
Proceedings of the Logics and Languages for Reliability and Security, 2010

Vagueness, Signaling and Bounded Rationality.
Proceedings of the New Frontiers in Artificial Intelligence, 2010

2009
Full operational set theory with unbounded existential quantification and power set.
Ann. Pure Appl. Log., 2009

Natural Color Categories Are Convex Sets.
Proceedings of the Logic, Language and Meaning - 17th Amsterdam Colloquium, 2009

2008
Applications of Game Theory in Linguistics.
Lang. Linguistics Compass, 2008

Canonical completeness of infinitary mu.
J. Log. Algebraic Methods Program., 2008

Preface.
J. Log. Algebraic Methods Program., 2008

2007
Language structure: psychological and social constraints.
Synth., 2007

Cut-free common knowledge.
J. Appl. Log., 2007

On Feferman's operational set theory OST.
Ann. Pure Appl. Log., 2007

2005
Corrigendum to "Variation on a theme of Schütte".
Math. Log. Q., 2005

Reflections on reflections in explicit mathematics.
Ann. Pure Appl. Log., 2005

About cut elimination for logics of common knowledge.
Ann. Pure Appl. Log., 2005

2004
Variation on a theme of Schütte.
Math. Log. Q., 2004

Residuation, Structural Rules and Context Freeness.
J. Log. Lang. Inf., 2004

An intensional fixed point theory over first order arithmetic.
Ann. Pure Appl. Log., 2004

2003
Recursion by optimization: on the complexity of bidirectional optimality theory.
Nat. Lang. Eng., 2003

2002
Some Notes on the Formal Properties of Bidirectional Optimality Theory.
J. Log. Lang. Inf., 2002

Extending the system T<sub>0</sub> of explicit mathematics: the limit and Mahlo axioms.
Ann. Pure Appl. Log., 2002

2001
Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.
J. Symb. Log., 2001

First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo.
J. Symb. Log., 2001

Topic‐Comment Structure and the Contrast Between Stage Level and Individual Level Predicates.
J. Semant., 2001

Lambek Grammars as Combinatory Categorial Grammars.
Log. J. IGPL, 2001

Universes in explicit mathematics.
Ann. Pure Appl. Log., 2001

2000
Fixed point theories and dependent choice.
Arch. Math. Log., 2000

1999
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.
J. Symb. Log., 1999

Bar Induction and omega Model Reflection.
Ann. Pure Appl. Log., 1999

1998
Editorial Logic Colloquium '95, Haifa, Israel.
Arch. Math. Log., 1998

Anaphora and Quantification in Categorial Grammar.
Proceedings of the Logical Aspects of Computational Linguistics, 1998

1997
Power Types in Explicit Mathematics.
J. Symb. Log., 1997

1996
Topics in dynamic semantics.
PhD thesis, 1996

Some Theories with Positive Induction of Ordinal Strength <i>phi omega 0</i>.
J. Symb. Log., 1996

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II.
Ann. Pure Appl. Log., 1996

A Logics Workbench.
AI Commun., 1996

1995
Totality in Applicative Theories.
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.
Ann. Pure Appl. Log., 1995

Second order theories with ordinals and elementary comprehension.
Arch. Math. Log., 1995

Propositional Logics on the Computer.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

1994
About Some Symmetries of Negation.
J. Symb. Log., 1994

1993
The Defining Power of Stratified and Hierarchical Logic Programs.
J. Log. Program., 1993

Fixed Points in Peano Arithmetic with Ordinals.
Ann. Pure Appl. Log., 1993

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I.
Ann. Pure Appl. Logic, 1993

1992
About the Proof-Theoretic Ordinals of Weak Fixed Point Theories.
J. Symb. Log., 1992

1991
Between constructive mathematics and PROLOG.
Arch. Math. Log., 1991

1990
Annotations on the Consistency of the Closed World Assumption.
J. Log. Program., 1990

Notions of Nonmonotonic Derivability.
Proceedings of the Nonmonotonic and Inductive Logic, 1990

1989
Proofs as Advanced and Powerful Tool.
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.
Proceedings of the CSL '87, 1987

1986
Countable Admissible Ordinals and Dilators.
Math. Log. Q., 1986

A Boundedness Theorem In mathrmID1 (W).
J. Symb. Log., 1986

Some Contributions to the Logical Analysis of Circumscrition.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985
Some proof-theoretic contributions to theories of sets.
Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1984
A Version of Kripke-Platek Set Theory which is Conservative over Peano Arithmetic.
Math. Log. Q., 1984

The Strength of Admissibility Without Foundation.
J. Symb. Log., 1984

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

1983
Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis.
J. Symb. Log., 1983

A well-ordering proof for Feferman's theory<i>T</i><sub>0</sub>.
Arch. Math. Log., 1983

1980
Beweistheorie von<i>KPN</i>.
Arch. Math. Log., 1980

Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen.
Arch. Math. Log., 1980


  Loading...