Reinhard Kahle

Orcid: 0000-0002-9064-877X

According to our database1, Reinhard Kahle authored at least 37 papers between 1999 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Zukunft der KI: Verantwortung und Vertrauen.
Proceedings of the 53. Jahrestagung der Gesellschaft für Informatik, INFORMATIK 2023, Designing Future, 2023

2022
Implicit recursion-theoretic characterizations of counting classes.
Arch. Math. Log., 2022

Geodaten als Open Data für die Künstliche Intelligenz.
Proceedings of the 52. Jahrestagung der Gesellschaft für Informatik, INFORMATIK 2022, Informatik in den Naturwissenschaften, 26., 2022

2021
k-Provability in $\hbox {PA}$.
Logica Universalis, 2021

Variants of Kreisel's Conjecture on a New Notion of Provability.
Bull. Symb. Log., 2021

A Recursion-Theoretic Characterization of the Probabilistic Class PP.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
The Intensional Structure of Epistemic Convictions.
Proceedings of the Software Engineering and Formal Methods. SEFM 2020 Collocated Workshops, 2020

Konzeptionelle Herausforderungen für die KI.
Proceedings of the 50. Jahrestagung der Gesellschaft für Informatik, INFORMATIK 2020 - Back to the Future, Karlsruhe, Germany, 28. September, 2020

Primzahlen als Herausforderung.
Proceedings of the 50. Jahrestagung der Gesellschaft für Informatik, INFORMATIK 2020 - Back to the Future, Karlsruhe, Germany, 28. September, 2020

2019
Is There a "Hilbert Thesis"?
Stud Logica, 2019

2017
The logical Cone.
FLAP, 2017

2016
Two function algebras defining functions in NC<sup>k</sup> boolean circuits.
Inf. Comput., 2016

Towards a Proof-Theoretic Semantics of Equalities.
Proceedings of the Advances in Proof-Theoretic Semantics., 2016

2015
Syntax versus Semantics.
CoRR, 2015

2014
Towards the Structure of Mathematical Proof.
Proceedings of the Joint Proceedings of the MathUI, 2014

2013
Applicative theories for the polynomial hierarchy of time and its levels.
Ann. Pure Appl. Log., 2013

2012
Modalities Without Worlds.
Proceedings of the Realism-Antirealism Debate in the Age of Alternative Logics, 2012

2011
The Universal Set and Diagonalization in Frege Structures.
Rev. Symb. Log., 2011

2010
An applicative theory for FPH
Proceedings of the Proceedings Third International Workshop on Classical Logic and Computation, 2010

2008
Recursion Schemata for NCk.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
Freek Wiedijk (Ed.), The Seventeen Provers of the World.
Stud Logica, 2007

Edwin D. Mares, Relevant Logic - A Philosophical Interpretation.
Stud Logica, 2007

2006
Introduction: Proof-theoretic Semantics.
Synth., 2006

A Proof-theoretic View of Necessity.
Synth., 2006

Towards an Implicit Characterization of <i>NC</i><sup><i>k</i></sup>.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Reflections On Frege And Hilbert.
Synth., 2005

Preface.
Ann. Pure Appl. Log., 2005

2003
Universes over Frege structures.
Ann. Pure Appl. Log., 2003

2002
Mathematical Proof Theory in the Light of Ordinal Analysis.
Synth., 2002

2001
Truth in Applicative Theories.
Stud Logica, 2001

Formalizing non-termination of recursive programs.
J. Log. Algebraic Methods Program., 2001

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

2000
Proof-theoretic notions for software maintenance.
Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2000

N\hbox{\sf N}-strictness in applicative theories.
Arch. Math. Log., 2000

A Theory of Explicit Mathematics Equivalent to ID<sub>1</sub>.
Proceedings of the Computer Science Logic, 2000

1999
Frege Structures for Partial Applicative Theories.
J. Log. Comput., 1999

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


  Loading...