Gerhard Jäger
Orcid: 0000-0002-9642-9359Affiliations:
- University of Bern, Switzerland
According to our database1,
Gerhard Jäger
authored at least 89 papers
between 1980 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on iam.unibe.ch
On csauthors.net:
Bibliography
2024
J. Log. Comput., 2024
Computational Approaches for Integrating out Subjectivity in Cognate Synonym Selection.
CoRR, 2024
Ann. Pure Appl. Log., 2024
Proceedings of the 6th Workshop on Research in Computational Linguistic Typology and Multilingual NLP, 2024
2021
2020
Lang. Resour. Evaluation, 2020
2019
Proceedings of the Logic, Language, Information, and Computation, 2019
2018
J. Symb. Log., 2018
J. Symb. Log., 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
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
Proceedings of the 13th Conference on Natural Language Processing, 2016
Proceedings of the Advances in Modal Logic 11, 2016
2014
Bull. Symb. Log., 2014
2013
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
J. Log. Lang. Inf., 2012
Adv. Complex Syst., 2012
2011
Proceedings of the Language, Games, and Evolution, 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
Proceedings of the 33th Annual Meeting of the Cognitive Science Society, 2011
2010
Proceedings of the Logics and Languages for Reliability and Security, 2010
Proceedings of the New Frontiers in Artificial Intelligence, 2010
2009
Ann. Pure Appl. Log., 2009
Proceedings of the Logic, Language and Meaning - 17th Amsterdam Colloquium, 2009
2008
2007
2005
2004
Ann. Pure Appl. Log., 2004
2003
Nat. Lang. Eng., 2003
2002
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
2000
1999
J. Symb. Log., 1999
1998
Proceedings of the Logical Aspects of Computational Linguistics, 1998
1997
1996
J. Symb. Log., 1996
Ann. Pure Appl. Log., 1996
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
Arch. Math. Log., 1995
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995
1994
1993
J. Log. Program., 1993
Ann. Pure Appl. Logic, 1993
1992
1991
1990
J. Log. Program., 1990
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
Proceedings of the CSL '87, 1987
1986
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
Math. Log. Q., 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
Arch. Math. Log., 1983
1980
Arch. Math. Log., 1980